<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.6"/>
<title>tinydtls: uthash.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">tinydtls
   &#160;<span id="projectnumber">0.8.2</span>
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.6 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="modules.html"><span>Modules</span></a></li>
      <li><a href="annotated.html"><span>Data&#160;Structures</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>Globals</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Data Structures</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Macros</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark">&#160;</span>Groups</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">uthash.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="uthash_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment">Copyright (c) 2003-2010, Troy D. Hanson     http://uthash.sourceforge.net</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment">All rights reserved.</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">Redistribution and use in source and binary forms, with or without</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment">modification, are permitted provided that the following conditions are met:</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment">    * Redistributions of source code must retain the above copyright</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment">      notice, this list of conditions and the following disclaimer.</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment">THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS &quot;AS</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">IS&quot; AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment">EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment">PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment">PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment">LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING</span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="comment">NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS</span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment">SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="comment">*/</span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;</div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="preprocessor">#ifndef _DTLS_UTHASH_H</span></div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define _DTLS_UTHASH_H </span></div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="preprocessor">#include &lt;string.h&gt;</span>   <span class="comment">/* memcmp,strlen */</span></div>
<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="preprocessor">#include &lt;stddef.h&gt;</span>   <span class="comment">/* ptrdiff_t */</span></div>
<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;</div>
<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="comment">/* These macros use decltype or the earlier __typeof GNU extension.</span></div>
<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="comment">   As decltype is only available in newer compilers (VS2010 or gcc 4.3+</span></div>
<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="comment">   when compiling c++ source) this code uses whatever method is needed</span></div>
<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="comment">   or, for VS2008 where neither is available, uses casting workarounds. */</span></div>
<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="preprocessor">#ifdef _MSC_VER         </span><span class="comment">/* MS compiler */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#if _MSC_VER &gt;= 1600 &amp;&amp; defined(__cplusplus)  </span><span class="comment">/* VS2010 or newer in C++ mode */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define DECLTYPE(x) (decltype(x))</span></div>
<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#else                   </span><span class="comment">/* VS2008 or older (or VS2010 in C mode) */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define NO_DECLTYPE</span></div>
<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define DECLTYPE(x)</span></div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#else                   </span><span class="comment">/* GNU, Sun and other compilers */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="uthash_8h.html#a716ba290563c2d955cb0c90d85874073">   42</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define DECLTYPE(x) (__typeof(x))</span></div>
<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;<span class="preprocessor">#ifdef NO_DECLTYPE</span></div>
<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define DECLTYPE_ASSIGN(dst,src)                                                 \</span></div>
<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;<span class="preprocessor">  char **_da_dst = (char**)(&amp;(dst));                                             \</span></div>
<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;<span class="preprocessor">  *_da_dst = (char*)(src);                                                       \</span></div>
<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;<span class="preprocessor">} while(0)</span></div>
<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#else </span></div>
<div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="uthash_8h.html#a3c736f2f2dd643f2987b2bc323e269ba">   52</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define DECLTYPE_ASSIGN(dst,src)                                                 \</span></div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;<span class="preprocessor">  (dst) = DECLTYPE(dst)(src);                                                    \</span></div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;<span class="preprocessor">} while(0)</span></div>
<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;<span class="comment">/* a number of the hash function use uint32_t which isn&#39;t defined on win32 */</span></div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;<span class="preprocessor">#ifdef _MSC_VER</span></div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;<span class="preprocessor"></span><span class="keyword">typedef</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> uint32_t;</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="preprocessor">#else</span></div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#include &lt;inttypes.h&gt;</span>   <span class="comment">/* uint32_t */</span></div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00065"></a><span class="lineno"><a class="line" href="uthash_8h.html#aa56cef9cb86dc1f4b5d27ee3a691077e">   65</a></span>&#160;<span class="preprocessor">#define UTHASH_VERSION 1.9.3</span></div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="uthash_8h.html#a03b52301b0ed976b6981ef33613320c1">   67</a></span>&#160;<span class="preprocessor">#define uthash_fatal(msg) exit(-1)        </span><span class="comment">/* fatal error (out of memory,etc) */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00068"></a><span class="lineno"><a class="line" href="uthash_8h.html#a861013aff36c0448f1888a2b0b5836d8">   68</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define uthash_malloc(sz) malloc(sz)      </span><span class="comment">/* malloc fcn                      */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="uthash_8h.html#a56cdf8c254fc700332c8e6a7263b4657">   69</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define uthash_free(ptr,sz) free(ptr)     </span><span class="comment">/* free fcn                        */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00071"></a><span class="lineno"><a class="line" href="uthash_8h.html#a7cc237d8f87de3836b5390856cfc5c86">   71</a></span>&#160;<span class="preprocessor">#define uthash_noexpand_fyi(tbl)          </span><span class="comment">/* can be defined to log noexpand  */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00072"></a><span class="lineno"><a class="line" href="uthash_8h.html#a86ea78714da520989a6f7a764b4d71b4">   72</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define uthash_expand_fyi(tbl)            </span><span class="comment">/* can be defined to log expands   */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;<span class="comment">/* initial number of buckets */</span></div>
<div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="uthash_8h.html#a361cdc5e8d6d8fe5fae6912588ae15d0">   75</a></span>&#160;<span class="preprocessor">#define HASH_INITIAL_NUM_BUCKETS 32      </span><span class="comment">/* initial number of buckets        */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00076"></a><span class="lineno"><a class="line" href="uthash_8h.html#a0b39a5cf1d6c05c43bd8530db2ec908c">   76</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_INITIAL_NUM_BUCKETS_LOG2 5  </span><span class="comment">/* lg2 of initial number of buckets */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="uthash_8h.html#a8ae3e6473261f6c4b78c030c94f5d68f">   77</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_BKT_CAPACITY_THRESH 10      </span><span class="comment">/* expand when bucket count reaches */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;<span class="comment">/* calculate the element whose hash handle address is hhe */</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="uthash_8h.html#a568e95048979b8b3e4ea1567fd91c186">   80</a></span>&#160;<span class="preprocessor">#define ELMT_FROM_HH(tbl,hhp) ((void*)(((char*)(hhp)) - ((tbl)-&gt;hho)))</span></div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00082"></a><span class="lineno"><a class="line" href="uthash_8h.html#ad4a1cd39c3044936c0e49d3f372c9dbf">   82</a></span>&#160;<span class="preprocessor">#define HASH_FIND(hh,head,keyptr,keylen,out)                                     \</span></div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;<span class="preprocessor">  unsigned _hf_bkt,_hf_hashv;                                                    \</span></div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;<span class="preprocessor">  out=NULL;                                                                      \</span></div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;<span class="preprocessor">  if (head) {                                                                    \</span></div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;<span class="preprocessor">     HASH_FCN(keyptr,keylen, (head)-&gt;hh.tbl-&gt;num_buckets, _hf_hashv, _hf_bkt);   \</span></div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;<span class="preprocessor">     if (HASH_BLOOM_TEST((head)-&gt;hh.tbl, _hf_hashv)) {                           \</span></div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;<span class="preprocessor">       HASH_FIND_IN_BKT((head)-&gt;hh.tbl, hh, (head)-&gt;hh.tbl-&gt;buckets[ _hf_bkt ],  \</span></div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;<span class="preprocessor">                        keyptr,keylen,out);                                      \</span></div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;<span class="preprocessor">     }                                                                           \</span></div>
<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;<span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;<span class="preprocessor">} while (0)</span></div>
<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;<span class="preprocessor">#ifdef HASH_BLOOM</span></div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_BLOOM_BITLEN (1ULL &lt;&lt; HASH_BLOOM)</span></div>
<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_BLOOM_BYTELEN (HASH_BLOOM_BITLEN/8) + ((HASH_BLOOM_BITLEN%8) ? 1:0)</span></div>
<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_BLOOM_MAKE(tbl)                                                     \</span></div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;<span class="preprocessor">  (tbl)-&gt;bloom_nbits = HASH_BLOOM;                                               \</span></div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;<span class="preprocessor">  (tbl)-&gt;bloom_bv = (uint8_t*)uthash_malloc(HASH_BLOOM_BYTELEN);                 \</span></div>
<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;<span class="preprocessor">  if (!((tbl)-&gt;bloom_bv))  { uthash_fatal( &quot;out of memory&quot;); }                   \</span></div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;<span class="preprocessor">  memset((tbl)-&gt;bloom_bv, 0, HASH_BLOOM_BYTELEN);                                \</span></div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;<span class="preprocessor">  (tbl)-&gt;bloom_sig = HASH_BLOOM_SIGNATURE;                                       \</span></div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;<span class="preprocessor">} while (0);</span></div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;<span class="preprocessor">#define HASH_BLOOM_FREE(tbl)                                                     \</span></div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;<span class="preprocessor">  uthash_free((tbl)-&gt;bloom_bv, HASH_BLOOM_BYTELEN);                              \</span></div>
<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;<span class="preprocessor">} while (0);</span></div>
<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;<span class="preprocessor">#define HASH_BLOOM_BITSET(bv,idx) (bv[(idx)/8] |= (1U &lt;&lt; ((idx)%8)))</span></div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_BLOOM_BITTEST(bv,idx) (bv[(idx)/8] &amp; (1U &lt;&lt; ((idx)%8)))</span></div>
<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;<span class="preprocessor">#define HASH_BLOOM_ADD(tbl,hashv)                                                \</span></div>
<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;<span class="preprocessor">  HASH_BLOOM_BITSET((tbl)-&gt;bloom_bv, (hashv &amp; (uint32_t)((1ULL &lt;&lt; (tbl)-&gt;bloom_nbits) - 1)))</span></div>
<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;<span class="preprocessor">#define HASH_BLOOM_TEST(tbl,hashv)                                               \</span></div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;<span class="preprocessor">  HASH_BLOOM_BITTEST((tbl)-&gt;bloom_bv, (hashv &amp; (uint32_t)((1ULL &lt;&lt; (tbl)-&gt;bloom_nbits) - 1)))</span></div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;<span class="preprocessor">#else</span></div>
<div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="uthash_8h.html#a254f427772a1fe7a2480a8302af8f8b8">  122</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_BLOOM_MAKE(tbl) </span></div>
<div class="line"><a name="l00123"></a><span class="lineno"><a class="line" href="uthash_8h.html#ad6847ad938fc26bfd0726d7f159efd0a">  123</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_BLOOM_FREE(tbl) </span></div>
<div class="line"><a name="l00124"></a><span class="lineno"><a class="line" href="uthash_8h.html#acaad947212056cd8bfe3d660265fb2db">  124</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_BLOOM_ADD(tbl,hashv) </span></div>
<div class="line"><a name="l00125"></a><span class="lineno"><a class="line" href="uthash_8h.html#a06bfbf880899d54da35487d0d39c1009">  125</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_BLOOM_TEST(tbl,hashv) (1)</span></div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00128"></a><span class="lineno"><a class="line" href="uthash_8h.html#aeba971430f623b6334f565d9c7ec9de5">  128</a></span>&#160;<span class="preprocessor">#define HASH_MAKE_TABLE(hh,head)                                                 \</span></div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;<span class="preprocessor">  (head)-&gt;hh.tbl = (UT_hash_table*)uthash_malloc(                                \</span></div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;<span class="preprocessor">                  sizeof(UT_hash_table));                                        \</span></div>
<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;<span class="preprocessor">  if (!((head)-&gt;hh.tbl))  { uthash_fatal( &quot;out of memory&quot;); }                    \</span></div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;<span class="preprocessor">  memset((head)-&gt;hh.tbl, 0, sizeof(UT_hash_table));                              \</span></div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;<span class="preprocessor">  (head)-&gt;hh.tbl-&gt;tail = &amp;((head)-&gt;hh);                                          \</span></div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;<span class="preprocessor">  (head)-&gt;hh.tbl-&gt;num_buckets = HASH_INITIAL_NUM_BUCKETS;                        \</span></div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;<span class="preprocessor">  (head)-&gt;hh.tbl-&gt;log2_num_buckets = HASH_INITIAL_NUM_BUCKETS_LOG2;              \</span></div>
<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;<span class="preprocessor">  (head)-&gt;hh.tbl-&gt;hho = (char*)(&amp;(head)-&gt;hh) - (char*)(head);                    \</span></div>
<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;<span class="preprocessor">  (head)-&gt;hh.tbl-&gt;buckets = (UT_hash_bucket*)uthash_malloc(                      \</span></div>
<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;<span class="preprocessor">          HASH_INITIAL_NUM_BUCKETS*sizeof(struct UT_hash_bucket));               \</span></div>
<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;<span class="preprocessor">  if (! (head)-&gt;hh.tbl-&gt;buckets) { uthash_fatal( &quot;out of memory&quot;); }             \</span></div>
<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;<span class="preprocessor">  memset((head)-&gt;hh.tbl-&gt;buckets, 0,                                             \</span></div>
<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;<span class="preprocessor">          HASH_INITIAL_NUM_BUCKETS*sizeof(struct UT_hash_bucket));               \</span></div>
<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;<span class="preprocessor">  HASH_BLOOM_MAKE((head)-&gt;hh.tbl);                                               \</span></div>
<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;<span class="preprocessor">  (head)-&gt;hh.tbl-&gt;signature = HASH_SIGNATURE;                                    \</span></div>
<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;<span class="preprocessor">} while(0)</span></div>
<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00147"></a><span class="lineno"><a class="line" href="uthash_8h.html#aaf01358e257c8d838eb5e4b189f0c399">  147</a></span>&#160;<span class="preprocessor">#define HASH_ADD(hh,head,fieldname,keylen_in,add)                                \</span></div>
<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;<span class="preprocessor">        HASH_ADD_KEYPTR(hh,head,&amp;add-&gt;fieldname,keylen_in,add)</span></div>
<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;<span class="preprocessor"></span> </div>
<div class="line"><a name="l00150"></a><span class="lineno"><a class="line" href="uthash_8h.html#a0b7468360b5c788762cdb2ccf9cd4d26">  150</a></span>&#160;<span class="preprocessor">#define HASH_ADD_KEYPTR(hh,head,keyptr,keylen_in,add)                            \</span></div>
<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;<span class="preprocessor"> unsigned _ha_bkt;                                                               \</span></div>
<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;<span class="preprocessor"> (add)-&gt;hh.next = NULL;                                                          \</span></div>
<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;<span class="preprocessor"> (add)-&gt;hh.key = (char*)keyptr;                                                  \</span></div>
<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;<span class="preprocessor"> (add)-&gt;hh.keylen = keylen_in;                                                   \</span></div>
<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;<span class="preprocessor"> if (!(head)) {                                                                  \</span></div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;<span class="preprocessor">    head = (add);                                                                \</span></div>
<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;<span class="preprocessor">    (head)-&gt;hh.prev = NULL;                                                      \</span></div>
<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;<span class="preprocessor">    HASH_MAKE_TABLE(hh,head);                                                    \</span></div>
<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;<span class="preprocessor"> } else {                                                                        \</span></div>
<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;<span class="preprocessor">    (head)-&gt;hh.tbl-&gt;tail-&gt;next = (add);                                          \</span></div>
<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;<span class="preprocessor">    (add)-&gt;hh.prev = ELMT_FROM_HH((head)-&gt;hh.tbl, (head)-&gt;hh.tbl-&gt;tail);         \</span></div>
<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;<span class="preprocessor">    (head)-&gt;hh.tbl-&gt;tail = &amp;((add)-&gt;hh);                                         \</span></div>
<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;<span class="preprocessor"> }                                                                               \</span></div>
<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;<span class="preprocessor"> (head)-&gt;hh.tbl-&gt;num_items++;                                                    \</span></div>
<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;<span class="preprocessor"> (add)-&gt;hh.tbl = (head)-&gt;hh.tbl;                                                 \</span></div>
<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;<span class="preprocessor"> HASH_FCN(keyptr,keylen_in, (head)-&gt;hh.tbl-&gt;num_buckets,                         \</span></div>
<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;<span class="preprocessor">         (add)-&gt;hh.hashv, _ha_bkt);                                              \</span></div>
<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;<span class="preprocessor"> HASH_ADD_TO_BKT((head)-&gt;hh.tbl-&gt;buckets[_ha_bkt],&amp;(add)-&gt;hh);                   \</span></div>
<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;<span class="preprocessor"> HASH_BLOOM_ADD((head)-&gt;hh.tbl,(add)-&gt;hh.hashv);                                 \</span></div>
<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;<span class="preprocessor"> HASH_EMIT_KEY(hh,head,keyptr,keylen_in);                                        \</span></div>
<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;<span class="preprocessor"> HASH_FSCK(hh,head);                                                             \</span></div>
<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;<span class="preprocessor">} while(0)</span></div>
<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00175"></a><span class="lineno"><a class="line" href="uthash_8h.html#a4d7691544128a6ef265f3e4fa5ed3113">  175</a></span>&#160;<span class="preprocessor">#define HASH_TO_BKT( hashv, num_bkts, bkt )                                      \</span></div>
<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;<span class="preprocessor">  bkt = ((hashv) &amp; ((num_bkts) - 1));                                            \</span></div>
<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;<span class="preprocessor">} while(0)</span></div>
<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;<span class="comment">/* delete &quot;delptr&quot; from the hash table.</span></div>
<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;<span class="comment"> * &quot;the usual&quot; patch-up process for the app-order doubly-linked-list.</span></div>
<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;<span class="comment"> * The use of _hd_hh_del below deserves special explanation.</span></div>
<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;<span class="comment"> * These used to be expressed using (delptr) but that led to a bug</span></div>
<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;<span class="comment"> * if someone used the same symbol for the head and deletee, like</span></div>
<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;<span class="comment"> *  HASH_DELETE(hh,users,users);</span></div>
<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;<span class="comment"> * We want that to work, but by changing the head (users) below</span></div>
<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;<span class="comment"> * we were forfeiting our ability to further refer to the deletee (users)</span></div>
<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;<span class="comment"> * in the patch-up process. Solution: use scratch space to</span></div>
<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;<span class="comment"> * copy the deletee pointer, then the latter references are via that</span></div>
<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;<span class="comment"> * scratch pointer rather than through the repointed (users) symbol.</span></div>
<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00192"></a><span class="lineno"><a class="line" href="uthash_8h.html#a3f83117e1108d63844a58d2d79c3b980">  192</a></span>&#160;<span class="preprocessor">#define HASH_DELETE(hh,head,delptr)                                              \</span></div>
<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;<span class="preprocessor">    unsigned _hd_bkt;                                                            \</span></div>
<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;<span class="preprocessor">    struct UT_hash_handle *_hd_hh_del;                                           \</span></div>
<div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;<span class="preprocessor">    if ( ((delptr)-&gt;hh.prev == NULL) &amp;&amp; ((delptr)-&gt;hh.next == NULL) )  {         \</span></div>
<div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;<span class="preprocessor">        uthash_free((head)-&gt;hh.tbl-&gt;buckets,                                     \</span></div>
<div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;<span class="preprocessor">                    (head)-&gt;hh.tbl-&gt;num_buckets*sizeof(struct UT_hash_bucket) ); \</span></div>
<div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;<span class="preprocessor">        HASH_BLOOM_FREE((head)-&gt;hh.tbl);                                         \</span></div>
<div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;<span class="preprocessor">        uthash_free((head)-&gt;hh.tbl, sizeof(UT_hash_table));                      \</span></div>
<div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;<span class="preprocessor">        head = NULL;                                                             \</span></div>
<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;<span class="preprocessor">    } else {                                                                     \</span></div>
<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;<span class="preprocessor">        _hd_hh_del = &amp;((delptr)-&gt;hh);                                            \</span></div>
<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;<span class="preprocessor">        if ((delptr) == ELMT_FROM_HH((head)-&gt;hh.tbl,(head)-&gt;hh.tbl-&gt;tail)) {     \</span></div>
<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;<span class="preprocessor">            (head)-&gt;hh.tbl-&gt;tail =                                               \</span></div>
<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;<span class="preprocessor">                (UT_hash_handle*)((char*)((delptr)-&gt;hh.prev) +                   \</span></div>
<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;<span class="preprocessor">                (head)-&gt;hh.tbl-&gt;hho);                                            \</span></div>
<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;<span class="preprocessor">        }                                                                        \</span></div>
<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;<span class="preprocessor">        if ((delptr)-&gt;hh.prev) {                                                 \</span></div>
<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;<span class="preprocessor">            ((UT_hash_handle*)((char*)((delptr)-&gt;hh.prev) +                      \</span></div>
<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;<span class="preprocessor">                    (head)-&gt;hh.tbl-&gt;hho))-&gt;next = (delptr)-&gt;hh.next;             \</span></div>
<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;<span class="preprocessor">        } else {                                                                 \</span></div>
<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;<span class="preprocessor">            DECLTYPE_ASSIGN(head,(delptr)-&gt;hh.next);                             \</span></div>
<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;<span class="preprocessor">        }                                                                        \</span></div>
<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;<span class="preprocessor">        if (_hd_hh_del-&gt;next) {                                                  \</span></div>
<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;<span class="preprocessor">            ((UT_hash_handle*)((char*)_hd_hh_del-&gt;next +                         \</span></div>
<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;<span class="preprocessor">                    (head)-&gt;hh.tbl-&gt;hho))-&gt;prev =                                \</span></div>
<div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;<span class="preprocessor">                    _hd_hh_del-&gt;prev;                                            \</span></div>
<div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;<span class="preprocessor">        }                                                                        \</span></div>
<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;<span class="preprocessor">        HASH_TO_BKT( _hd_hh_del-&gt;hashv, (head)-&gt;hh.tbl-&gt;num_buckets, _hd_bkt);   \</span></div>
<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;<span class="preprocessor">        HASH_DEL_IN_BKT(hh,(head)-&gt;hh.tbl-&gt;buckets[_hd_bkt], _hd_hh_del);        \</span></div>
<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;<span class="preprocessor">        (head)-&gt;hh.tbl-&gt;num_items--;                                             \</span></div>
<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;<span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;<span class="preprocessor">    HASH_FSCK(hh,head);                                                          \</span></div>
<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;<span class="preprocessor">} while (0)</span></div>
<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;</div>
<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;<span class="comment">/* convenience forms of HASH_FIND/HASH_ADD/HASH_DEL */</span></div>
<div class="line"><a name="l00229"></a><span class="lineno"><a class="line" href="uthash_8h.html#a214529083adfab2fa8cd402d2eeb0a84">  229</a></span>&#160;<span class="preprocessor">#define HASH_FIND_STR(head,findstr,out)                                          \</span></div>
<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;<span class="preprocessor">    HASH_FIND(hh,head,findstr,strlen(findstr),out)</span></div>
<div class="line"><a name="l00231"></a><span class="lineno"><a class="line" href="uthash_8h.html#a9724951736f3985f74df17638c8a7885">  231</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_ADD_STR(head,strfield,add)                                          \</span></div>
<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;<span class="preprocessor">    HASH_ADD(hh,head,strfield,strlen(add-&gt;strfield),add)</span></div>
<div class="line"><a name="l00233"></a><span class="lineno"><a class="line" href="uthash_8h.html#aadcb19b940348f3141bd51505ede0142">  233</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_FIND_INT(head,findint,out)                                          \</span></div>
<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;<span class="preprocessor">    HASH_FIND(hh,head,findint,sizeof(int),out)</span></div>
<div class="line"><a name="l00235"></a><span class="lineno"><a class="line" href="uthash_8h.html#acf85835471af894e354efb7e346698f3">  235</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_ADD_INT(head,intfield,add)                                          \</span></div>
<div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;<span class="preprocessor">    HASH_ADD(hh,head,intfield,sizeof(int),add)</span></div>
<div class="line"><a name="l00237"></a><span class="lineno"><a class="line" href="uthash_8h.html#a26a887f8e31952034becac0cf446f6c3">  237</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_FIND_PTR(head,findptr,out)                                          \</span></div>
<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;<span class="preprocessor">    HASH_FIND(hh,head,findptr,sizeof(void *),out)</span></div>
<div class="line"><a name="l00239"></a><span class="lineno"><a class="line" href="uthash_8h.html#a2ad1f84ef1ba9df99fa2ada38cb61823">  239</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_ADD_PTR(head,ptrfield,add)                                          \</span></div>
<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;<span class="preprocessor">    HASH_ADD(hh,head,ptrfield,sizeof(void *),add)</span></div>
<div class="line"><a name="l00241"></a><span class="lineno"><a class="line" href="uthash_8h.html#a48b7ed374602dcb236501aa23a971f05">  241</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_DEL(head,delptr)                                                    \</span></div>
<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;<span class="preprocessor">    HASH_DELETE(hh,head,delptr)</span></div>
<div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;<span class="comment">/* HASH_FSCK checks hash integrity on every add/delete when HASH_DEBUG is defined.</span></div>
<div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;<span class="comment"> * This is for uthash developer only; it compiles away if HASH_DEBUG isn&#39;t defined.</span></div>
<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;<span class="preprocessor">#ifdef HASH_DEBUG</span></div>
<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_OOPS(...) do { fprintf(stderr,__VA_ARGS__); exit(-1); } while (0)</span></div>
<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_FSCK(hh,head)                                                       \</span></div>
<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;<span class="preprocessor">    unsigned _bkt_i;                                                             \</span></div>
<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;<span class="preprocessor">    unsigned _count, _bkt_count;                                                 \</span></div>
<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;<span class="preprocessor">    char *_prev;                                                                 \</span></div>
<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;<span class="preprocessor">    struct UT_hash_handle *_thh;                                                 \</span></div>
<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;<span class="preprocessor">    if (head) {                                                                  \</span></div>
<div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;<span class="preprocessor">        _count = 0;                                                              \</span></div>
<div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;<span class="preprocessor">        for( _bkt_i = 0; _bkt_i &lt; (head)-&gt;hh.tbl-&gt;num_buckets; _bkt_i++) {       \</span></div>
<div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;<span class="preprocessor">            _bkt_count = 0;                                                      \</span></div>
<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;<span class="preprocessor">            _thh = (head)-&gt;hh.tbl-&gt;buckets[_bkt_i].hh_head;                      \</span></div>
<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;<span class="preprocessor">            _prev = NULL;                                                        \</span></div>
<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;<span class="preprocessor">            while (_thh) {                                                       \</span></div>
<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;<span class="preprocessor">               if (_prev != (char*)(_thh-&gt;hh_prev)) {                            \</span></div>
<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;<span class="preprocessor">                   HASH_OOPS(&quot;invalid hh_prev %p, actual %p\n&quot;,                  \</span></div>
<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;<span class="preprocessor">                    _thh-&gt;hh_prev, _prev );                                      \</span></div>
<div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;<span class="preprocessor">               }                                                                 \</span></div>
<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;<span class="preprocessor">               _bkt_count++;                                                     \</span></div>
<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;<span class="preprocessor">               _prev = (char*)(_thh);                                            \</span></div>
<div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;<span class="preprocessor">               _thh = _thh-&gt;hh_next;                                             \</span></div>
<div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;<span class="preprocessor">            }                                                                    \</span></div>
<div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;<span class="preprocessor">            _count += _bkt_count;                                                \</span></div>
<div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;<span class="preprocessor">            if ((head)-&gt;hh.tbl-&gt;buckets[_bkt_i].count !=  _bkt_count) {          \</span></div>
<div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;<span class="preprocessor">               HASH_OOPS(&quot;invalid bucket count %d, actual %d\n&quot;,                 \</span></div>
<div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;<span class="preprocessor">                (head)-&gt;hh.tbl-&gt;buckets[_bkt_i].count, _bkt_count);              \</span></div>
<div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;<span class="preprocessor">            }                                                                    \</span></div>
<div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;<span class="preprocessor">        }                                                                        \</span></div>
<div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;<span class="preprocessor">        if (_count != (head)-&gt;hh.tbl-&gt;num_items) {                               \</span></div>
<div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;<span class="preprocessor">            HASH_OOPS(&quot;invalid hh item count %d, actual %d\n&quot;,                   \</span></div>
<div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;<span class="preprocessor">                (head)-&gt;hh.tbl-&gt;num_items, _count );                             \</span></div>
<div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;<span class="preprocessor">        }                                                                        \</span></div>
<div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;<span class="preprocessor">        </span><span class="comment">/* traverse hh in app order; check next/prev integrity, count */</span><span class="preprocessor">         \</span></div>
<div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;<span class="preprocessor">        _count = 0;                                                              \</span></div>
<div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;<span class="preprocessor">        _prev = NULL;                                                            \</span></div>
<div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;<span class="preprocessor">        _thh =  &amp;(head)-&gt;hh;                                                     \</span></div>
<div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;<span class="preprocessor">        while (_thh) {                                                           \</span></div>
<div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;<span class="preprocessor">           _count++;                                                             \</span></div>
<div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;<span class="preprocessor">           if (_prev !=(char*)(_thh-&gt;prev)) {                                    \</span></div>
<div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;<span class="preprocessor">              HASH_OOPS(&quot;invalid prev %p, actual %p\n&quot;,                          \</span></div>
<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;<span class="preprocessor">                    _thh-&gt;prev, _prev );                                         \</span></div>
<div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;<span class="preprocessor">           }                                                                     \</span></div>
<div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;<span class="preprocessor">           _prev = (char*)ELMT_FROM_HH((head)-&gt;hh.tbl, _thh);                    \</span></div>
<div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;<span class="preprocessor">           _thh = ( _thh-&gt;next ?  (UT_hash_handle*)((char*)(_thh-&gt;next) +        \</span></div>
<div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;<span class="preprocessor">                                  (head)-&gt;hh.tbl-&gt;hho) : NULL );                 \</span></div>
<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;<span class="preprocessor">        }                                                                        \</span></div>
<div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;<span class="preprocessor">        if (_count != (head)-&gt;hh.tbl-&gt;num_items) {                               \</span></div>
<div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;<span class="preprocessor">            HASH_OOPS(&quot;invalid app item count %d, actual %d\n&quot;,                  \</span></div>
<div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;<span class="preprocessor">                (head)-&gt;hh.tbl-&gt;num_items, _count );                             \</span></div>
<div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;<span class="preprocessor">        }                                                                        \</span></div>
<div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;<span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;<span class="preprocessor">} while (0)</span></div>
<div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#else</span></div>
<div class="line"><a name="l00301"></a><span class="lineno"><a class="line" href="uthash_8h.html#a7d882fadb26a4e6c13c134d8be4d0759">  301</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_FSCK(hh,head) </span></div>
<div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;<span class="comment">/* When compiled with -DHASH_EMIT_KEYS, length-prefixed keys are emitted to </span></div>
<div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;<span class="comment"> * the descriptor to which this macro is defined for tuning the hash function.</span></div>
<div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;<span class="comment"> * The app can #include &lt;unistd.h&gt; to get the prototype for write(2). */</span></div>
<div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;<span class="preprocessor">#ifdef HASH_EMIT_KEYS</span></div>
<div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_EMIT_KEY(hh,head,keyptr,fieldlen)                                   \</span></div>
<div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;<span class="preprocessor">    unsigned _klen = fieldlen;                                                   \</span></div>
<div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;<span class="preprocessor">    write(HASH_EMIT_KEYS, &amp;_klen, sizeof(_klen));                                \</span></div>
<div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;<span class="preprocessor">    write(HASH_EMIT_KEYS, keyptr, fieldlen);                                     \</span></div>
<div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;<span class="preprocessor">} while (0)</span></div>
<div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#else </span></div>
<div class="line"><a name="l00315"></a><span class="lineno"><a class="line" href="uthash_8h.html#a44f9d46e2cc79652492e5dd3e6c40a15">  315</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_EMIT_KEY(hh,head,keyptr,fieldlen)                    </span></div>
<div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;<span class="comment">/* default to Jenkin&#39;s hash unless overridden e.g. DHASH_FUNCTION=HASH_SAX */</span></div>
<div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;<span class="preprocessor">#ifdef HASH_FUNCTION </span></div>
<div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_FCN HASH_FUNCTION</span></div>
<div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#else</span></div>
<div class="line"><a name="l00322"></a><span class="lineno"><a class="line" href="uthash_8h.html#abd3356419b386c379116393700a751d3">  322</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_FCN HASH_JEN</span></div>
<div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;<span class="comment">/* The Bernstein hash function, used in Perl prior to v5.6 */</span></div>
<div class="line"><a name="l00326"></a><span class="lineno"><a class="line" href="uthash_8h.html#a7271bf51d7fe2cf2c183578aee73601e">  326</a></span>&#160;<span class="preprocessor">#define HASH_BER(key,keylen,num_bkts,hashv,bkt)                                  \</span></div>
<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;<span class="preprocessor">  unsigned _hb_keylen=keylen;                                                    \</span></div>
<div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;<span class="preprocessor">  char *_hb_key=(char*)(key);                                                    \</span></div>
<div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;<span class="preprocessor">  (hashv) = 0;                                                                   \</span></div>
<div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;<span class="preprocessor">  while (_hb_keylen--)  { (hashv) = ((hashv) * 33) + *_hb_key++; }               \</span></div>
<div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;<span class="preprocessor">  bkt = (hashv) &amp; (num_bkts-1);                                                  \</span></div>
<div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;<span class="preprocessor">} while (0)</span></div>
<div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;</div>
<div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;<span class="comment">/* SAX/FNV/OAT/JEN hash functions are macro variants of those listed at </span></div>
<div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;<span class="comment"> * http://eternallyconfuzzled.com/tuts/algorithms/jsw_tut_hashing.aspx */</span></div>
<div class="line"><a name="l00338"></a><span class="lineno"><a class="line" href="uthash_8h.html#aa4cb140b45415e7bf57237525388af79">  338</a></span>&#160;<span class="preprocessor">#define HASH_SAX(key,keylen,num_bkts,hashv,bkt)                                  \</span></div>
<div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;<span class="preprocessor">  unsigned _sx_i;                                                                \</span></div>
<div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;<span class="preprocessor">  char *_hs_key=(char*)(key);                                                    \</span></div>
<div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;<span class="preprocessor">  hashv = 0;                                                                     \</span></div>
<div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;<span class="preprocessor">  for(_sx_i=0; _sx_i &lt; keylen; _sx_i++)                                          \</span></div>
<div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;<span class="preprocessor">      hashv ^= (hashv &lt;&lt; 5) + (hashv &gt;&gt; 2) + _hs_key[_sx_i];                     \</span></div>
<div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;<span class="preprocessor">  bkt = hashv &amp; (num_bkts-1);                                                    \</span></div>
<div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;<span class="preprocessor">} while (0)</span></div>
<div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00348"></a><span class="lineno"><a class="line" href="uthash_8h.html#ac99f9a353421537527a80b392089dd9d">  348</a></span>&#160;<span class="preprocessor">#define HASH_FNV(key,keylen,num_bkts,hashv,bkt)                                  \</span></div>
<div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;<span class="preprocessor">  unsigned _fn_i;                                                                \</span></div>
<div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160;<span class="preprocessor">  char *_hf_key=(char*)(key);                                                    \</span></div>
<div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;<span class="preprocessor">  hashv = 2166136261UL;                                                          \</span></div>
<div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;<span class="preprocessor">  for(_fn_i=0; _fn_i &lt; keylen; _fn_i++)                                          \</span></div>
<div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;<span class="preprocessor">      hashv = (hashv * 16777619) ^ _hf_key[_fn_i];                               \</span></div>
<div class="line"><a name="l00355"></a><span class="lineno">  355</span>&#160;<span class="preprocessor">  bkt = hashv &amp; (num_bkts-1);                                                    \</span></div>
<div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;<span class="preprocessor">} while(0);</span></div>
<div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;<span class="preprocessor"></span> </div>
<div class="line"><a name="l00358"></a><span class="lineno"><a class="line" href="uthash_8h.html#abc7040b698211c1993441fb4165fa0b4">  358</a></span>&#160;<span class="preprocessor">#define HASH_OAT(key,keylen,num_bkts,hashv,bkt)                                  \</span></div>
<div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;<span class="preprocessor">  unsigned _ho_i;                                                                \</span></div>
<div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;<span class="preprocessor">  char *_ho_key=(char*)(key);                                                    \</span></div>
<div class="line"><a name="l00362"></a><span class="lineno">  362</span>&#160;<span class="preprocessor">  hashv = 0;                                                                     \</span></div>
<div class="line"><a name="l00363"></a><span class="lineno">  363</span>&#160;<span class="preprocessor">  for(_ho_i=0; _ho_i &lt; keylen; _ho_i++) {                                        \</span></div>
<div class="line"><a name="l00364"></a><span class="lineno">  364</span>&#160;<span class="preprocessor">      hashv += _ho_key[_ho_i];                                                   \</span></div>
<div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160;<span class="preprocessor">      hashv += (hashv &lt;&lt; 10);                                                    \</span></div>
<div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;<span class="preprocessor">      hashv ^= (hashv &gt;&gt; 6);                                                     \</span></div>
<div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;<span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;<span class="preprocessor">  hashv += (hashv &lt;&lt; 3);                                                         \</span></div>
<div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#160;<span class="preprocessor">  hashv ^= (hashv &gt;&gt; 11);                                                        \</span></div>
<div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160;<span class="preprocessor">  hashv += (hashv &lt;&lt; 15);                                                        \</span></div>
<div class="line"><a name="l00371"></a><span class="lineno">  371</span>&#160;<span class="preprocessor">  bkt = hashv &amp; (num_bkts-1);                                                    \</span></div>
<div class="line"><a name="l00372"></a><span class="lineno">  372</span>&#160;<span class="preprocessor">} while(0)</span></div>
<div class="line"><a name="l00373"></a><span class="lineno">  373</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00374"></a><span class="lineno"><a class="line" href="uthash_8h.html#a6d37144e54d2bd49eb88fbfd04c59dc5">  374</a></span>&#160;<span class="preprocessor">#define HASH_JEN_MIX(a,b,c)                                                      \</span></div>
<div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00376"></a><span class="lineno">  376</span>&#160;<span class="preprocessor">  a -= b; a -= c; a ^= ( c &gt;&gt; 13 );                                              \</span></div>
<div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;<span class="preprocessor">  b -= c; b -= a; b ^= ( a &lt;&lt; 8 );                                               \</span></div>
<div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;<span class="preprocessor">  c -= a; c -= b; c ^= ( b &gt;&gt; 13 );                                              \</span></div>
<div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;<span class="preprocessor">  a -= b; a -= c; a ^= ( c &gt;&gt; 12 );                                              \</span></div>
<div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;<span class="preprocessor">  b -= c; b -= a; b ^= ( a &lt;&lt; 16 );                                              \</span></div>
<div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;<span class="preprocessor">  c -= a; c -= b; c ^= ( b &gt;&gt; 5 );                                               \</span></div>
<div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;<span class="preprocessor">  a -= b; a -= c; a ^= ( c &gt;&gt; 3 );                                               \</span></div>
<div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;<span class="preprocessor">  b -= c; b -= a; b ^= ( a &lt;&lt; 10 );                                              \</span></div>
<div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;<span class="preprocessor">  c -= a; c -= b; c ^= ( b &gt;&gt; 15 );                                              \</span></div>
<div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;<span class="preprocessor">} while (0)</span></div>
<div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00387"></a><span class="lineno"><a class="line" href="uthash_8h.html#aa16e3ae6125d7f10d3deb4695e0ee51e">  387</a></span>&#160;<span class="preprocessor">#define HASH_JEN(key,keylen,num_bkts,hashv,bkt)                                  \</span></div>
<div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;<span class="preprocessor">  unsigned _hj_i,_hj_j,_hj_k;                                                    \</span></div>
<div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;<span class="preprocessor">  char *_hj_key=(char*)(key);                                                    \</span></div>
<div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;<span class="preprocessor">  hashv = 0xfeedbeef;                                                            \</span></div>
<div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;<span class="preprocessor">  _hj_i = _hj_j = 0x9e3779b9;                                                    \</span></div>
<div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;<span class="preprocessor">  _hj_k = keylen;                                                                \</span></div>
<div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;<span class="preprocessor">  while (_hj_k &gt;= 12) {                                                          \</span></div>
<div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;<span class="preprocessor">    _hj_i +=    (_hj_key[0] + ( (unsigned)_hj_key[1] &lt;&lt; 8 )                      \</span></div>
<div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;<span class="preprocessor">        + ( (unsigned)_hj_key[2] &lt;&lt; 16 )                                         \</span></div>
<div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;<span class="preprocessor">        + ( (unsigned)_hj_key[3] &lt;&lt; 24 ) );                                      \</span></div>
<div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;<span class="preprocessor">    _hj_j +=    (_hj_key[4] + ( (unsigned)_hj_key[5] &lt;&lt; 8 )                      \</span></div>
<div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;<span class="preprocessor">        + ( (unsigned)_hj_key[6] &lt;&lt; 16 )                                         \</span></div>
<div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160;<span class="preprocessor">        + ( (unsigned)_hj_key[7] &lt;&lt; 24 ) );                                      \</span></div>
<div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160;<span class="preprocessor">    hashv += (_hj_key[8] + ( (unsigned)_hj_key[9] &lt;&lt; 8 )                         \</span></div>
<div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;<span class="preprocessor">        + ( (unsigned)_hj_key[10] &lt;&lt; 16 )                                        \</span></div>
<div class="line"><a name="l00403"></a><span class="lineno">  403</span>&#160;<span class="preprocessor">        + ( (unsigned)_hj_key[11] &lt;&lt; 24 ) );                                     \</span></div>
<div class="line"><a name="l00404"></a><span class="lineno">  404</span>&#160;<span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a name="l00405"></a><span class="lineno">  405</span>&#160;<span class="preprocessor">     HASH_JEN_MIX(_hj_i, _hj_j, hashv);                                          \</span></div>
<div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;<span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a name="l00407"></a><span class="lineno">  407</span>&#160;<span class="preprocessor">     _hj_key += 12;                                                              \</span></div>
<div class="line"><a name="l00408"></a><span class="lineno">  408</span>&#160;<span class="preprocessor">     _hj_k -= 12;                                                                \</span></div>
<div class="line"><a name="l00409"></a><span class="lineno">  409</span>&#160;<span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a name="l00410"></a><span class="lineno">  410</span>&#160;<span class="preprocessor">  hashv += keylen;                                                               \</span></div>
<div class="line"><a name="l00411"></a><span class="lineno">  411</span>&#160;<span class="preprocessor">  switch ( _hj_k ) {                                                             \</span></div>
<div class="line"><a name="l00412"></a><span class="lineno">  412</span>&#160;<span class="preprocessor">     case 11: hashv += ( (unsigned)_hj_key[10] &lt;&lt; 24 );                          \</span></div>
<div class="line"><a name="l00413"></a><span class="lineno">  413</span>&#160;<span class="preprocessor">     case 10: hashv += ( (unsigned)_hj_key[9] &lt;&lt; 16 );                           \</span></div>
<div class="line"><a name="l00414"></a><span class="lineno">  414</span>&#160;<span class="preprocessor">     case 9:  hashv += ( (unsigned)_hj_key[8] &lt;&lt; 8 );                            \</span></div>
<div class="line"><a name="l00415"></a><span class="lineno">  415</span>&#160;<span class="preprocessor">     case 8:  _hj_j += ( (unsigned)_hj_key[7] &lt;&lt; 24 );                           \</span></div>
<div class="line"><a name="l00416"></a><span class="lineno">  416</span>&#160;<span class="preprocessor">     case 7:  _hj_j += ( (unsigned)_hj_key[6] &lt;&lt; 16 );                           \</span></div>
<div class="line"><a name="l00417"></a><span class="lineno">  417</span>&#160;<span class="preprocessor">     case 6:  _hj_j += ( (unsigned)_hj_key[5] &lt;&lt; 8 );                            \</span></div>
<div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160;<span class="preprocessor">     case 5:  _hj_j += _hj_key[4];                                               \</span></div>
<div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;<span class="preprocessor">     case 4:  _hj_i += ( (unsigned)_hj_key[3] &lt;&lt; 24 );                           \</span></div>
<div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;<span class="preprocessor">     case 3:  _hj_i += ( (unsigned)_hj_key[2] &lt;&lt; 16 );                           \</span></div>
<div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160;<span class="preprocessor">     case 2:  _hj_i += ( (unsigned)_hj_key[1] &lt;&lt; 8 );                            \</span></div>
<div class="line"><a name="l00422"></a><span class="lineno">  422</span>&#160;<span class="preprocessor">     case 1:  _hj_i += _hj_key[0];                                               \</span></div>
<div class="line"><a name="l00423"></a><span class="lineno">  423</span>&#160;<span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a name="l00424"></a><span class="lineno">  424</span>&#160;<span class="preprocessor">  HASH_JEN_MIX(_hj_i, _hj_j, hashv);                                             \</span></div>
<div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;<span class="preprocessor">  bkt = hashv &amp; (num_bkts-1);                                                    \</span></div>
<div class="line"><a name="l00426"></a><span class="lineno">  426</span>&#160;<span class="preprocessor">} while(0)</span></div>
<div class="line"><a name="l00427"></a><span class="lineno">  427</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;<span class="comment">/* The Paul Hsieh hash function */</span></div>
<div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;<span class="preprocessor">#undef get16bits</span></div>
<div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#if (defined(__GNUC__) &amp;&amp; defined(__i386__)) || defined(__WATCOMC__)             \</span></div>
<div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;<span class="preprocessor">  || defined(_MSC_VER) || defined (__BORLANDC__) || defined (__TURBOC__)</span></div>
<div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define get16bits(d) (*((const uint16_t *) (d)))</span></div>
<div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00435"></a><span class="lineno">  435</span>&#160;<span class="preprocessor">#if !defined (get16bits)</span></div>
<div class="line"><a name="l00436"></a><span class="lineno"><a class="line" href="uthash_8h.html#abc7d71657be8975a51684e41029b7964">  436</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define get16bits(d) ((((uint32_t)(((const uint8_t *)(d))[1])) &lt;&lt; 8)             \</span></div>
<div class="line"><a name="l00437"></a><span class="lineno">  437</span>&#160;<span class="preprocessor">                       +(uint32_t)(((const uint8_t *)(d))[0]) )</span></div>
<div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00439"></a><span class="lineno"><a class="line" href="uthash_8h.html#ab595698a74642684dace0dfa47dab445">  439</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_SFH(key,keylen,num_bkts,hashv,bkt)                                  \</span></div>
<div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;<span class="preprocessor">  char *_sfh_key=(char*)(key);                                                   \</span></div>
<div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;<span class="preprocessor">  uint32_t _sfh_tmp, _sfh_len = keylen;                                          \</span></div>
<div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;<span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160;<span class="preprocessor">  int _sfh_rem = _sfh_len &amp; 3;                                                   \</span></div>
<div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;<span class="preprocessor">  _sfh_len &gt;&gt;= 2;                                                                \</span></div>
<div class="line"><a name="l00446"></a><span class="lineno">  446</span>&#160;<span class="preprocessor">  hashv = 0xcafebabe;                                                            \</span></div>
<div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;<span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a name="l00448"></a><span class="lineno">  448</span>&#160;<span class="preprocessor">  </span><span class="comment">/* Main loop */</span><span class="preprocessor">                                                                \</span></div>
<div class="line"><a name="l00449"></a><span class="lineno">  449</span>&#160;<span class="preprocessor">  for (;_sfh_len &gt; 0; _sfh_len--) {                                              \</span></div>
<div class="line"><a name="l00450"></a><span class="lineno">  450</span>&#160;<span class="preprocessor">    hashv    += get16bits (_sfh_key);                                            \</span></div>
<div class="line"><a name="l00451"></a><span class="lineno">  451</span>&#160;<span class="preprocessor">    _sfh_tmp       = (get16bits (_sfh_key+2) &lt;&lt; 11) ^ hashv;                     \</span></div>
<div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;<span class="preprocessor">    hashv     = (hashv &lt;&lt; 16) ^ _sfh_tmp;                                        \</span></div>
<div class="line"><a name="l00453"></a><span class="lineno">  453</span>&#160;<span class="preprocessor">    _sfh_key += 2*sizeof (uint16_t);                                             \</span></div>
<div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;<span class="preprocessor">    hashv    += hashv &gt;&gt; 11;                                                     \</span></div>
<div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160;<span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a name="l00456"></a><span class="lineno">  456</span>&#160;<span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a name="l00457"></a><span class="lineno">  457</span>&#160;<span class="preprocessor">  </span><span class="comment">/* Handle end cases */</span><span class="preprocessor">                                                         \</span></div>
<div class="line"><a name="l00458"></a><span class="lineno">  458</span>&#160;<span class="preprocessor">  switch (_sfh_rem) {                                                            \</span></div>
<div class="line"><a name="l00459"></a><span class="lineno">  459</span>&#160;<span class="preprocessor">    case 3: hashv += get16bits (_sfh_key);                                       \</span></div>
<div class="line"><a name="l00460"></a><span class="lineno">  460</span>&#160;<span class="preprocessor">            hashv ^= hashv &lt;&lt; 16;                                                \</span></div>
<div class="line"><a name="l00461"></a><span class="lineno">  461</span>&#160;<span class="preprocessor">            hashv ^= _sfh_key[sizeof (uint16_t)] &lt;&lt; 18;                          \</span></div>
<div class="line"><a name="l00462"></a><span class="lineno">  462</span>&#160;<span class="preprocessor">            hashv += hashv &gt;&gt; 11;                                                \</span></div>
<div class="line"><a name="l00463"></a><span class="lineno">  463</span>&#160;<span class="preprocessor">            break;                                                               \</span></div>
<div class="line"><a name="l00464"></a><span class="lineno">  464</span>&#160;<span class="preprocessor">    case 2: hashv += get16bits (_sfh_key);                                       \</span></div>
<div class="line"><a name="l00465"></a><span class="lineno">  465</span>&#160;<span class="preprocessor">            hashv ^= hashv &lt;&lt; 11;                                                \</span></div>
<div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;<span class="preprocessor">            hashv += hashv &gt;&gt; 17;                                                \</span></div>
<div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;<span class="preprocessor">            break;                                                               \</span></div>
<div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;<span class="preprocessor">    case 1: hashv += *_sfh_key;                                                  \</span></div>
<div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160;<span class="preprocessor">            hashv ^= hashv &lt;&lt; 10;                                                \</span></div>
<div class="line"><a name="l00470"></a><span class="lineno">  470</span>&#160;<span class="preprocessor">            hashv += hashv &gt;&gt; 1;                                                 \</span></div>
<div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160;<span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a name="l00472"></a><span class="lineno">  472</span>&#160;<span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;<span class="preprocessor">    </span><span class="comment">/* Force &quot;avalanching&quot; of final 127 bits */</span><span class="preprocessor">                                  \</span></div>
<div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160;<span class="preprocessor">    hashv ^= hashv &lt;&lt; 3;                                                         \</span></div>
<div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;<span class="preprocessor">    hashv += hashv &gt;&gt; 5;                                                         \</span></div>
<div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;<span class="preprocessor">    hashv ^= hashv &lt;&lt; 4;                                                         \</span></div>
<div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;<span class="preprocessor">    hashv += hashv &gt;&gt; 17;                                                        \</span></div>
<div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;<span class="preprocessor">    hashv ^= hashv &lt;&lt; 25;                                                        \</span></div>
<div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160;<span class="preprocessor">    hashv += hashv &gt;&gt; 6;                                                         \</span></div>
<div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;<span class="preprocessor">    bkt = hashv &amp; (num_bkts-1);                                                  \</span></div>
<div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;<span class="preprocessor">} while(0);</span></div>
<div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;<span class="preprocessor">#ifdef HASH_USING_NO_STRICT_ALIASING</span></div>
<div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;<span class="preprocessor"></span><span class="comment">/* The MurmurHash exploits some CPU&#39;s (e.g. x86) tolerance for unaligned reads.</span></div>
<div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;<span class="comment"> * For other types of CPU&#39;s (e.g. Sparc) an unaligned read causes a bus error.</span></div>
<div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;<span class="comment"> * So MurmurHash comes in two versions, the faster unaligned one and the slower</span></div>
<div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;<span class="comment"> * aligned one. We only use the faster one on CPU&#39;s where we know it&#39;s safe. </span></div>
<div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;<span class="comment"> * Note the preprocessor built-in defines can be emitted using:</span></div>
<div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;<span class="comment"> *   gcc -m64 -dM -E - &lt; /dev/null                  (on gcc)</span></div>
<div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;<span class="comment"> *   cc -## a.c (where a.c is a simple test file)   (Sun Studio)</span></div>
<div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;<span class="preprocessor">#if (defined(__i386__) || defined(__x86_64__)) </span></div>
<div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_MUR HASH_MUR_UNALIGNED</span></div>
<div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#else</span></div>
<div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_MUR HASH_MUR_ALIGNED</span></div>
<div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;<span class="comment">/* Appleby&#39;s MurmurHash fast version for unaligned-tolerant archs like i386 */</span></div>
<div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;<span class="preprocessor">#define HASH_MUR_UNALIGNED(key,keylen,num_bkts,hashv,bkt)                        \</span></div>
<div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;<span class="preprocessor">  const unsigned int _mur_m = 0x5bd1e995;                                        \</span></div>
<div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;<span class="preprocessor">  const int _mur_r = 24;                                                         \</span></div>
<div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160;<span class="preprocessor">  hashv = 0xcafebabe ^ keylen;                                                   \</span></div>
<div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160;<span class="preprocessor">  char *_mur_key = (char *)(key);                                                \</span></div>
<div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;<span class="preprocessor">  uint32_t _mur_tmp, _mur_len = keylen;                                          \</span></div>
<div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;<span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;<span class="preprocessor">  for (;_mur_len &gt;= 4; _mur_len-=4) {                                            \</span></div>
<div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;<span class="preprocessor">    _mur_tmp = *(uint32_t *)_mur_key;                                            \</span></div>
<div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;<span class="preprocessor">    _mur_tmp *= _mur_m;                                                          \</span></div>
<div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;<span class="preprocessor">    _mur_tmp ^= _mur_tmp &gt;&gt; _mur_r;                                              \</span></div>
<div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;<span class="preprocessor">    _mur_tmp *= _mur_m;                                                          \</span></div>
<div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;<span class="preprocessor">    hashv *= _mur_m;                                                             \</span></div>
<div class="line"><a name="l00515"></a><span class="lineno">  515</span>&#160;<span class="preprocessor">    hashv ^= _mur_tmp;                                                           \</span></div>
<div class="line"><a name="l00516"></a><span class="lineno">  516</span>&#160;<span class="preprocessor">    _mur_key += 4;                                                               \</span></div>
<div class="line"><a name="l00517"></a><span class="lineno">  517</span>&#160;<span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a name="l00518"></a><span class="lineno">  518</span>&#160;<span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a name="l00519"></a><span class="lineno">  519</span>&#160;<span class="preprocessor">  switch(_mur_len)                                                               \</span></div>
<div class="line"><a name="l00520"></a><span class="lineno">  520</span>&#160;<span class="preprocessor">  {                                                                              \</span></div>
<div class="line"><a name="l00521"></a><span class="lineno">  521</span>&#160;<span class="preprocessor">    case 3: hashv ^= _mur_key[2] &lt;&lt; 16;                                          \</span></div>
<div class="line"><a name="l00522"></a><span class="lineno">  522</span>&#160;<span class="preprocessor">    case 2: hashv ^= _mur_key[1] &lt;&lt; 8;                                           \</span></div>
<div class="line"><a name="l00523"></a><span class="lineno">  523</span>&#160;<span class="preprocessor">    case 1: hashv ^= _mur_key[0];                                                \</span></div>
<div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160;<span class="preprocessor">            hashv *= _mur_m;                                                     \</span></div>
<div class="line"><a name="l00525"></a><span class="lineno">  525</span>&#160;<span class="preprocessor">  };                                                                             \</span></div>
<div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160;<span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a name="l00527"></a><span class="lineno">  527</span>&#160;<span class="preprocessor">  hashv ^= hashv &gt;&gt; 13;                                                          \</span></div>
<div class="line"><a name="l00528"></a><span class="lineno">  528</span>&#160;<span class="preprocessor">  hashv *= _mur_m;                                                               \</span></div>
<div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;<span class="preprocessor">  hashv ^= hashv &gt;&gt; 15;                                                          \</span></div>
<div class="line"><a name="l00530"></a><span class="lineno">  530</span>&#160;<span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;<span class="preprocessor">  bkt = hashv &amp; (num_bkts-1);                                                    \</span></div>
<div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;<span class="preprocessor">} while(0)</span></div>
<div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;<span class="comment">/* Appleby&#39;s MurmurHash version for alignment-sensitive archs like Sparc */</span></div>
<div class="line"><a name="l00535"></a><span class="lineno">  535</span>&#160;<span class="preprocessor">#define HASH_MUR_ALIGNED(key,keylen,num_bkts,hashv,bkt)                          \</span></div>
<div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00537"></a><span class="lineno">  537</span>&#160;<span class="preprocessor">  const unsigned int _mur_m = 0x5bd1e995;                                        \</span></div>
<div class="line"><a name="l00538"></a><span class="lineno">  538</span>&#160;<span class="preprocessor">  const int _mur_r = 24;                                                         \</span></div>
<div class="line"><a name="l00539"></a><span class="lineno">  539</span>&#160;<span class="preprocessor">  hashv = 0xcafebabe ^ (keylen);                                                 \</span></div>
<div class="line"><a name="l00540"></a><span class="lineno">  540</span>&#160;<span class="preprocessor">  char *_mur_key = (char *)(key);                                                \</span></div>
<div class="line"><a name="l00541"></a><span class="lineno">  541</span>&#160;<span class="preprocessor">  uint32_t _mur_len = keylen;                                                    \</span></div>
<div class="line"><a name="l00542"></a><span class="lineno">  542</span>&#160;<span class="preprocessor">  int _mur_align = (int)_mur_key &amp; 3;                                            \</span></div>
<div class="line"><a name="l00543"></a><span class="lineno">  543</span>&#160;<span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a name="l00544"></a><span class="lineno">  544</span>&#160;<span class="preprocessor">  if (_mur_align &amp;&amp; (_mur_len &gt;= 4)) {                                           \</span></div>
<div class="line"><a name="l00545"></a><span class="lineno">  545</span>&#160;<span class="preprocessor">    unsigned _mur_t = 0, _mur_d = 0;                                             \</span></div>
<div class="line"><a name="l00546"></a><span class="lineno">  546</span>&#160;<span class="preprocessor">    switch(_mur_align) {                                                         \</span></div>
<div class="line"><a name="l00547"></a><span class="lineno">  547</span>&#160;<span class="preprocessor">      case 1: _mur_t |= _mur_key[2] &lt;&lt; 16;                                       \</span></div>
<div class="line"><a name="l00548"></a><span class="lineno">  548</span>&#160;<span class="preprocessor">      case 2: _mur_t |= _mur_key[1] &lt;&lt; 8;                                        \</span></div>
<div class="line"><a name="l00549"></a><span class="lineno">  549</span>&#160;<span class="preprocessor">      case 3: _mur_t |= _mur_key[0];                                             \</span></div>
<div class="line"><a name="l00550"></a><span class="lineno">  550</span>&#160;<span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a name="l00551"></a><span class="lineno">  551</span>&#160;<span class="preprocessor">    _mur_t &lt;&lt;= (8 * _mur_align);                                                 \</span></div>
<div class="line"><a name="l00552"></a><span class="lineno">  552</span>&#160;<span class="preprocessor">    _mur_key += 4-_mur_align;                                                    \</span></div>
<div class="line"><a name="l00553"></a><span class="lineno">  553</span>&#160;<span class="preprocessor">    _mur_len -= 4-_mur_align;                                                    \</span></div>
<div class="line"><a name="l00554"></a><span class="lineno">  554</span>&#160;<span class="preprocessor">    int _mur_sl = 8 * (4-_mur_align);                                            \</span></div>
<div class="line"><a name="l00555"></a><span class="lineno">  555</span>&#160;<span class="preprocessor">    int _mur_sr = 8 * _mur_align;                                                \</span></div>
<div class="line"><a name="l00556"></a><span class="lineno">  556</span>&#160;<span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a name="l00557"></a><span class="lineno">  557</span>&#160;<span class="preprocessor">    for (;_mur_len &gt;= 4; _mur_len-=4) {                                          \</span></div>
<div class="line"><a name="l00558"></a><span class="lineno">  558</span>&#160;<span class="preprocessor">      _mur_d = *(unsigned *)_mur_key;                                            \</span></div>
<div class="line"><a name="l00559"></a><span class="lineno">  559</span>&#160;<span class="preprocessor">      _mur_t = (_mur_t &gt;&gt; _mur_sr) | (_mur_d &lt;&lt; _mur_sl);                        \</span></div>
<div class="line"><a name="l00560"></a><span class="lineno">  560</span>&#160;<span class="preprocessor">      unsigned _mur_k = _mur_t;                                                  \</span></div>
<div class="line"><a name="l00561"></a><span class="lineno">  561</span>&#160;<span class="preprocessor">      _mur_k *= _mur_m;                                                          \</span></div>
<div class="line"><a name="l00562"></a><span class="lineno">  562</span>&#160;<span class="preprocessor">      _mur_k ^= _mur_k &gt;&gt; _mur_r;                                                \</span></div>
<div class="line"><a name="l00563"></a><span class="lineno">  563</span>&#160;<span class="preprocessor">      _mur_k *= _mur_m;                                                          \</span></div>
<div class="line"><a name="l00564"></a><span class="lineno">  564</span>&#160;<span class="preprocessor">      hashv *= _mur_m;                                                           \</span></div>
<div class="line"><a name="l00565"></a><span class="lineno">  565</span>&#160;<span class="preprocessor">      hashv ^= _mur_k;                                                           \</span></div>
<div class="line"><a name="l00566"></a><span class="lineno">  566</span>&#160;<span class="preprocessor">      _mur_t = _mur_d;                                                           \</span></div>
<div class="line"><a name="l00567"></a><span class="lineno">  567</span>&#160;<span class="preprocessor">      _mur_key += 4;                                                             \</span></div>
<div class="line"><a name="l00568"></a><span class="lineno">  568</span>&#160;<span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a name="l00569"></a><span class="lineno">  569</span>&#160;<span class="preprocessor">    _mur_d = 0;                                                                  \</span></div>
<div class="line"><a name="l00570"></a><span class="lineno">  570</span>&#160;<span class="preprocessor">    if(_mur_len &gt;= _mur_align) {                                                 \</span></div>
<div class="line"><a name="l00571"></a><span class="lineno">  571</span>&#160;<span class="preprocessor">      switch(_mur_align) {                                                       \</span></div>
<div class="line"><a name="l00572"></a><span class="lineno">  572</span>&#160;<span class="preprocessor">        case 3: _mur_d |= _mur_key[2] &lt;&lt; 16;                                     \</span></div>
<div class="line"><a name="l00573"></a><span class="lineno">  573</span>&#160;<span class="preprocessor">        case 2: _mur_d |= _mur_key[1] &lt;&lt; 8;                                      \</span></div>
<div class="line"><a name="l00574"></a><span class="lineno">  574</span>&#160;<span class="preprocessor">        case 1: _mur_d |= _mur_key[0];                                           \</span></div>
<div class="line"><a name="l00575"></a><span class="lineno">  575</span>&#160;<span class="preprocessor">      }                                                                          \</span></div>
<div class="line"><a name="l00576"></a><span class="lineno">  576</span>&#160;<span class="preprocessor">      unsigned _mur_k = (_mur_t &gt;&gt; _mur_sr) | (_mur_d &lt;&lt; _mur_sl);               \</span></div>
<div class="line"><a name="l00577"></a><span class="lineno">  577</span>&#160;<span class="preprocessor">      _mur_k *= _mur_m;                                                          \</span></div>
<div class="line"><a name="l00578"></a><span class="lineno">  578</span>&#160;<span class="preprocessor">      _mur_k ^= _mur_k &gt;&gt; _mur_r;                                                \</span></div>
<div class="line"><a name="l00579"></a><span class="lineno">  579</span>&#160;<span class="preprocessor">      _mur_k *= _mur_m;                                                          \</span></div>
<div class="line"><a name="l00580"></a><span class="lineno">  580</span>&#160;<span class="preprocessor">      hashv *= _mur_m;                                                           \</span></div>
<div class="line"><a name="l00581"></a><span class="lineno">  581</span>&#160;<span class="preprocessor">      hashv ^= _mur_k;                                                           \</span></div>
<div class="line"><a name="l00582"></a><span class="lineno">  582</span>&#160;<span class="preprocessor">      _mur_k += _mur_align;                                                      \</span></div>
<div class="line"><a name="l00583"></a><span class="lineno">  583</span>&#160;<span class="preprocessor">      _mur_len -= _mur_align;                                                    \</span></div>
<div class="line"><a name="l00584"></a><span class="lineno">  584</span>&#160;<span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a name="l00585"></a><span class="lineno">  585</span>&#160;<span class="preprocessor">      switch(_mur_len)                                                           \</span></div>
<div class="line"><a name="l00586"></a><span class="lineno">  586</span>&#160;<span class="preprocessor">      {                                                                          \</span></div>
<div class="line"><a name="l00587"></a><span class="lineno">  587</span>&#160;<span class="preprocessor">        case 3: hashv ^= _mur_key[2] &lt;&lt; 16;                                      \</span></div>
<div class="line"><a name="l00588"></a><span class="lineno">  588</span>&#160;<span class="preprocessor">        case 2: hashv ^= _mur_key[1] &lt;&lt; 8;                                       \</span></div>
<div class="line"><a name="l00589"></a><span class="lineno">  589</span>&#160;<span class="preprocessor">        case 1: hashv ^= _mur_key[0];                                            \</span></div>
<div class="line"><a name="l00590"></a><span class="lineno">  590</span>&#160;<span class="preprocessor">                hashv *= _mur_m;                                                 \</span></div>
<div class="line"><a name="l00591"></a><span class="lineno">  591</span>&#160;<span class="preprocessor">      }                                                                          \</span></div>
<div class="line"><a name="l00592"></a><span class="lineno">  592</span>&#160;<span class="preprocessor">    } else {                                                                     \</span></div>
<div class="line"><a name="l00593"></a><span class="lineno">  593</span>&#160;<span class="preprocessor">      switch(_mur_len)                                                           \</span></div>
<div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;<span class="preprocessor">      {                                                                          \</span></div>
<div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;<span class="preprocessor">        case 3: _mur_d ^= _mur_key[2] &lt;&lt; 16;                                     \</span></div>
<div class="line"><a name="l00596"></a><span class="lineno">  596</span>&#160;<span class="preprocessor">        case 2: _mur_d ^= _mur_key[1] &lt;&lt; 8;                                      \</span></div>
<div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160;<span class="preprocessor">        case 1: _mur_d ^= _mur_key[0];                                           \</span></div>
<div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;<span class="preprocessor">        case 0: hashv ^= (_mur_t &gt;&gt; _mur_sr) | (_mur_d &lt;&lt; _mur_sl);              \</span></div>
<div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;<span class="preprocessor">        hashv *= _mur_m;                                                         \</span></div>
<div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;<span class="preprocessor">      }                                                                          \</span></div>
<div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;<span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;<span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;<span class="preprocessor">    hashv ^= hashv &gt;&gt; 13;                                                        \</span></div>
<div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;<span class="preprocessor">    hashv *= _mur_m;                                                             \</span></div>
<div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160;<span class="preprocessor">    hashv ^= hashv &gt;&gt; 15;                                                        \</span></div>
<div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160;<span class="preprocessor">  } else {                                                                       \</span></div>
<div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;<span class="preprocessor">    for (;_mur_len &gt;= 4; _mur_len-=4) {                                          \</span></div>
<div class="line"><a name="l00608"></a><span class="lineno">  608</span>&#160;<span class="preprocessor">      unsigned _mur_k = *(unsigned*)_mur_key;                                    \</span></div>
<div class="line"><a name="l00609"></a><span class="lineno">  609</span>&#160;<span class="preprocessor">      _mur_k *= _mur_m;                                                          \</span></div>
<div class="line"><a name="l00610"></a><span class="lineno">  610</span>&#160;<span class="preprocessor">      _mur_k ^= _mur_k &gt;&gt; _mur_r;                                                \</span></div>
<div class="line"><a name="l00611"></a><span class="lineno">  611</span>&#160;<span class="preprocessor">      _mur_k *= _mur_m;                                                          \</span></div>
<div class="line"><a name="l00612"></a><span class="lineno">  612</span>&#160;<span class="preprocessor">      hashv *= _mur_m;                                                           \</span></div>
<div class="line"><a name="l00613"></a><span class="lineno">  613</span>&#160;<span class="preprocessor">      hashv ^= _mur_k;                                                           \</span></div>
<div class="line"><a name="l00614"></a><span class="lineno">  614</span>&#160;<span class="preprocessor">      _mur_key += 4;                                                             \</span></div>
<div class="line"><a name="l00615"></a><span class="lineno">  615</span>&#160;<span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a name="l00616"></a><span class="lineno">  616</span>&#160;<span class="preprocessor">    switch(_mur_len)                                                             \</span></div>
<div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160;<span class="preprocessor">    {                                                                            \</span></div>
<div class="line"><a name="l00618"></a><span class="lineno">  618</span>&#160;<span class="preprocessor">      case 3: hashv ^= _mur_key[2] &lt;&lt; 16;                                        \</span></div>
<div class="line"><a name="l00619"></a><span class="lineno">  619</span>&#160;<span class="preprocessor">      case 2: hashv ^= _mur_key[1] &lt;&lt; 8;                                         \</span></div>
<div class="line"><a name="l00620"></a><span class="lineno">  620</span>&#160;<span class="preprocessor">      case 1: hashv ^= _mur_key[0];                                              \</span></div>
<div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;<span class="preprocessor">      hashv *= _mur_m;                                                           \</span></div>
<div class="line"><a name="l00622"></a><span class="lineno">  622</span>&#160;<span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160;<span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;<span class="preprocessor">    hashv ^= hashv &gt;&gt; 13;                                                        \</span></div>
<div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;<span class="preprocessor">    hashv *= _mur_m;                                                             \</span></div>
<div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160;<span class="preprocessor">    hashv ^= hashv &gt;&gt; 15;                                                        \</span></div>
<div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;<span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;<span class="preprocessor">  bkt = hashv &amp; (num_bkts-1);                                                    \</span></div>
<div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;<span class="preprocessor">} while(0)</span></div>
<div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#endif  </span><span class="comment">/* HASH_USING_NO_STRICT_ALIASING */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160;<span class="comment">/* key comparison function; return 0 if keys equal */</span></div>
<div class="line"><a name="l00633"></a><span class="lineno"><a class="line" href="uthash_8h.html#a35c9b682ebb7a8cbf284b9f0a9594095">  633</a></span>&#160;<span class="preprocessor">#define HASH_KEYCMP(a,b,len) memcmp(a,b,len) </span></div>
<div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;<span class="comment">/* iterate over items in a known bucket to find desired item */</span></div>
<div class="line"><a name="l00636"></a><span class="lineno"><a class="line" href="uthash_8h.html#a42ae87cc63106a82601808f19329502c">  636</a></span>&#160;<span class="preprocessor">#define HASH_FIND_IN_BKT(tbl,hh,head,keyptr,keylen_in,out)                       \</span></div>
<div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;<span class="preprocessor"> if (head.hh_head) DECLTYPE_ASSIGN(out,ELMT_FROM_HH(tbl,head.hh_head));          \</span></div>
<div class="line"><a name="l00639"></a><span class="lineno">  639</span>&#160;<span class="preprocessor"> else out=NULL;                                                                  \</span></div>
<div class="line"><a name="l00640"></a><span class="lineno">  640</span>&#160;<span class="preprocessor"> while (out) {                                                                   \</span></div>
<div class="line"><a name="l00641"></a><span class="lineno">  641</span>&#160;<span class="preprocessor">    if (out-&gt;hh.keylen == keylen_in) {                                           \</span></div>
<div class="line"><a name="l00642"></a><span class="lineno">  642</span>&#160;<span class="preprocessor">        if ((HASH_KEYCMP(out-&gt;hh.key,keyptr,keylen_in)) == 0) break;             \</span></div>
<div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;<span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a name="l00644"></a><span class="lineno">  644</span>&#160;<span class="preprocessor">    if (out-&gt;hh.hh_next) DECLTYPE_ASSIGN(out,ELMT_FROM_HH(tbl,out-&gt;hh.hh_next)); \</span></div>
<div class="line"><a name="l00645"></a><span class="lineno">  645</span>&#160;<span class="preprocessor">    else out = NULL;                                                             \</span></div>
<div class="line"><a name="l00646"></a><span class="lineno">  646</span>&#160;<span class="preprocessor"> }                                                                               \</span></div>
<div class="line"><a name="l00647"></a><span class="lineno">  647</span>&#160;<span class="preprocessor">} while(0)</span></div>
<div class="line"><a name="l00648"></a><span class="lineno">  648</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00649"></a><span class="lineno">  649</span>&#160;<span class="comment">/* add an item to a bucket  */</span></div>
<div class="line"><a name="l00650"></a><span class="lineno"><a class="line" href="uthash_8h.html#a78e11adee321f45c5cb31ff2d6eb0348">  650</a></span>&#160;<span class="preprocessor">#define HASH_ADD_TO_BKT(head,addhh)                                              \</span></div>
<div class="line"><a name="l00651"></a><span class="lineno">  651</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00652"></a><span class="lineno">  652</span>&#160;<span class="preprocessor"> head.count++;                                                                   \</span></div>
<div class="line"><a name="l00653"></a><span class="lineno">  653</span>&#160;<span class="preprocessor"> (addhh)-&gt;hh_next = head.hh_head;                                                \</span></div>
<div class="line"><a name="l00654"></a><span class="lineno">  654</span>&#160;<span class="preprocessor"> (addhh)-&gt;hh_prev = NULL;                                                        \</span></div>
<div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;<span class="preprocessor"> if (head.hh_head) { (head).hh_head-&gt;hh_prev = (addhh); }                        \</span></div>
<div class="line"><a name="l00656"></a><span class="lineno">  656</span>&#160;<span class="preprocessor"> (head).hh_head=addhh;                                                           \</span></div>
<div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160;<span class="preprocessor"> if (head.count &gt;= ((head.expand_mult+1) * HASH_BKT_CAPACITY_THRESH)             \</span></div>
<div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160;<span class="preprocessor">     &amp;&amp; (addhh)-&gt;tbl-&gt;noexpand != 1) {                                           \</span></div>
<div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;<span class="preprocessor">       HASH_EXPAND_BUCKETS((addhh)-&gt;tbl);                                        \</span></div>
<div class="line"><a name="l00660"></a><span class="lineno">  660</span>&#160;<span class="preprocessor"> }                                                                               \</span></div>
<div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;<span class="preprocessor">} while(0)</span></div>
<div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;<span class="comment">/* remove an item from a given bucket */</span></div>
<div class="line"><a name="l00664"></a><span class="lineno"><a class="line" href="uthash_8h.html#a1b2d6f694f98cf6350cdd18225cb3f78">  664</a></span>&#160;<span class="preprocessor">#define HASH_DEL_IN_BKT(hh,head,hh_del)                                          \</span></div>
<div class="line"><a name="l00665"></a><span class="lineno">  665</span>&#160;<span class="preprocessor">    (head).count--;                                                              \</span></div>
<div class="line"><a name="l00666"></a><span class="lineno">  666</span>&#160;<span class="preprocessor">    if ((head).hh_head == hh_del) {                                              \</span></div>
<div class="line"><a name="l00667"></a><span class="lineno">  667</span>&#160;<span class="preprocessor">      (head).hh_head = hh_del-&gt;hh_next;                                          \</span></div>
<div class="line"><a name="l00668"></a><span class="lineno">  668</span>&#160;<span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a name="l00669"></a><span class="lineno">  669</span>&#160;<span class="preprocessor">    if (hh_del-&gt;hh_prev) {                                                       \</span></div>
<div class="line"><a name="l00670"></a><span class="lineno">  670</span>&#160;<span class="preprocessor">        hh_del-&gt;hh_prev-&gt;hh_next = hh_del-&gt;hh_next;                              \</span></div>
<div class="line"><a name="l00671"></a><span class="lineno">  671</span>&#160;<span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a name="l00672"></a><span class="lineno">  672</span>&#160;<span class="preprocessor">    if (hh_del-&gt;hh_next) {                                                       \</span></div>
<div class="line"><a name="l00673"></a><span class="lineno">  673</span>&#160;<span class="preprocessor">        hh_del-&gt;hh_next-&gt;hh_prev = hh_del-&gt;hh_prev;                              \</span></div>
<div class="line"><a name="l00674"></a><span class="lineno">  674</span>&#160;<span class="preprocessor">    }                                                                </span></div>
<div class="line"><a name="l00675"></a><span class="lineno">  675</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00676"></a><span class="lineno">  676</span>&#160;<span class="comment">/* Bucket expansion has the effect of doubling the number of buckets</span></div>
<div class="line"><a name="l00677"></a><span class="lineno">  677</span>&#160;<span class="comment"> * and redistributing the items into the new buckets. Ideally the</span></div>
<div class="line"><a name="l00678"></a><span class="lineno">  678</span>&#160;<span class="comment"> * items will distribute more or less evenly into the new buckets</span></div>
<div class="line"><a name="l00679"></a><span class="lineno">  679</span>&#160;<span class="comment"> * (the extent to which this is true is a measure of the quality of</span></div>
<div class="line"><a name="l00680"></a><span class="lineno">  680</span>&#160;<span class="comment"> * the hash function as it applies to the key domain). </span></div>
<div class="line"><a name="l00681"></a><span class="lineno">  681</span>&#160;<span class="comment"> * </span></div>
<div class="line"><a name="l00682"></a><span class="lineno">  682</span>&#160;<span class="comment"> * With the items distributed into more buckets, the chain length</span></div>
<div class="line"><a name="l00683"></a><span class="lineno">  683</span>&#160;<span class="comment"> * (item count) in each bucket is reduced. Thus by expanding buckets</span></div>
<div class="line"><a name="l00684"></a><span class="lineno">  684</span>&#160;<span class="comment"> * the hash keeps a bound on the chain length. This bounded chain </span></div>
<div class="line"><a name="l00685"></a><span class="lineno">  685</span>&#160;<span class="comment"> * length is the essence of how a hash provides constant time lookup.</span></div>
<div class="line"><a name="l00686"></a><span class="lineno">  686</span>&#160;<span class="comment"> * </span></div>
<div class="line"><a name="l00687"></a><span class="lineno">  687</span>&#160;<span class="comment"> * The calculation of tbl-&gt;ideal_chain_maxlen below deserves some</span></div>
<div class="line"><a name="l00688"></a><span class="lineno">  688</span>&#160;<span class="comment"> * explanation. First, keep in mind that we&#39;re calculating the ideal</span></div>
<div class="line"><a name="l00689"></a><span class="lineno">  689</span>&#160;<span class="comment"> * maximum chain length based on the *new* (doubled) bucket count.</span></div>
<div class="line"><a name="l00690"></a><span class="lineno">  690</span>&#160;<span class="comment"> * In fractions this is just n/b (n=number of items,b=new num buckets).</span></div>
<div class="line"><a name="l00691"></a><span class="lineno">  691</span>&#160;<span class="comment"> * Since the ideal chain length is an integer, we want to calculate </span></div>
<div class="line"><a name="l00692"></a><span class="lineno">  692</span>&#160;<span class="comment"> * ceil(n/b). We don&#39;t depend on floating point arithmetic in this</span></div>
<div class="line"><a name="l00693"></a><span class="lineno">  693</span>&#160;<span class="comment"> * hash, so to calculate ceil(n/b) with integers we could write</span></div>
<div class="line"><a name="l00694"></a><span class="lineno">  694</span>&#160;<span class="comment"> * </span></div>
<div class="line"><a name="l00695"></a><span class="lineno">  695</span>&#160;<span class="comment"> *      ceil(n/b) = (n/b) + ((n%b)?1:0)</span></div>
<div class="line"><a name="l00696"></a><span class="lineno">  696</span>&#160;<span class="comment"> * </span></div>
<div class="line"><a name="l00697"></a><span class="lineno">  697</span>&#160;<span class="comment"> * and in fact a previous version of this hash did just that.</span></div>
<div class="line"><a name="l00698"></a><span class="lineno">  698</span>&#160;<span class="comment"> * But now we have improved things a bit by recognizing that b is</span></div>
<div class="line"><a name="l00699"></a><span class="lineno">  699</span>&#160;<span class="comment"> * always a power of two. We keep its base 2 log handy (call it lb),</span></div>
<div class="line"><a name="l00700"></a><span class="lineno">  700</span>&#160;<span class="comment"> * so now we can write this with a bit shift and logical AND:</span></div>
<div class="line"><a name="l00701"></a><span class="lineno">  701</span>&#160;<span class="comment"> * </span></div>
<div class="line"><a name="l00702"></a><span class="lineno">  702</span>&#160;<span class="comment"> *      ceil(n/b) = (n&gt;&gt;lb) + ( (n &amp; (b-1)) ? 1:0)</span></div>
<div class="line"><a name="l00703"></a><span class="lineno">  703</span>&#160;<span class="comment"> * </span></div>
<div class="line"><a name="l00704"></a><span class="lineno">  704</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00705"></a><span class="lineno"><a class="line" href="uthash_8h.html#a6439fd6271474e61b1840fbf83132f03">  705</a></span>&#160;<span class="preprocessor">#define HASH_EXPAND_BUCKETS(tbl)                                                 \</span></div>
<div class="line"><a name="l00706"></a><span class="lineno">  706</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00707"></a><span class="lineno">  707</span>&#160;<span class="preprocessor">    unsigned _he_bkt;                                                            \</span></div>
<div class="line"><a name="l00708"></a><span class="lineno">  708</span>&#160;<span class="preprocessor">    unsigned _he_bkt_i;                                                          \</span></div>
<div class="line"><a name="l00709"></a><span class="lineno">  709</span>&#160;<span class="preprocessor">    struct UT_hash_handle *_he_thh, *_he_hh_nxt;                                 \</span></div>
<div class="line"><a name="l00710"></a><span class="lineno">  710</span>&#160;<span class="preprocessor">    UT_hash_bucket *_he_new_buckets, *_he_newbkt;                                \</span></div>
<div class="line"><a name="l00711"></a><span class="lineno">  711</span>&#160;<span class="preprocessor">    _he_new_buckets = (UT_hash_bucket*)uthash_malloc(                            \</span></div>
<div class="line"><a name="l00712"></a><span class="lineno">  712</span>&#160;<span class="preprocessor">             2 * tbl-&gt;num_buckets * sizeof(struct UT_hash_bucket));              \</span></div>
<div class="line"><a name="l00713"></a><span class="lineno">  713</span>&#160;<span class="preprocessor">    if (!_he_new_buckets) { uthash_fatal( &quot;out of memory&quot;); }                    \</span></div>
<div class="line"><a name="l00714"></a><span class="lineno">  714</span>&#160;<span class="preprocessor">    memset(_he_new_buckets, 0,                                                   \</span></div>
<div class="line"><a name="l00715"></a><span class="lineno">  715</span>&#160;<span class="preprocessor">            2 * tbl-&gt;num_buckets * sizeof(struct UT_hash_bucket));               \</span></div>
<div class="line"><a name="l00716"></a><span class="lineno">  716</span>&#160;<span class="preprocessor">    tbl-&gt;ideal_chain_maxlen =                                                    \</span></div>
<div class="line"><a name="l00717"></a><span class="lineno">  717</span>&#160;<span class="preprocessor">       (tbl-&gt;num_items &gt;&gt; (tbl-&gt;log2_num_buckets+1)) +                           \</span></div>
<div class="line"><a name="l00718"></a><span class="lineno">  718</span>&#160;<span class="preprocessor">       ((tbl-&gt;num_items &amp; ((tbl-&gt;num_buckets*2)-1)) ? 1 : 0);                    \</span></div>
<div class="line"><a name="l00719"></a><span class="lineno">  719</span>&#160;<span class="preprocessor">    tbl-&gt;nonideal_items = 0;                                                     \</span></div>
<div class="line"><a name="l00720"></a><span class="lineno">  720</span>&#160;<span class="preprocessor">    for(_he_bkt_i = 0; _he_bkt_i &lt; tbl-&gt;num_buckets; _he_bkt_i++)                \</span></div>
<div class="line"><a name="l00721"></a><span class="lineno">  721</span>&#160;<span class="preprocessor">    {                                                                            \</span></div>
<div class="line"><a name="l00722"></a><span class="lineno">  722</span>&#160;<span class="preprocessor">        _he_thh = tbl-&gt;buckets[ _he_bkt_i ].hh_head;                             \</span></div>
<div class="line"><a name="l00723"></a><span class="lineno">  723</span>&#160;<span class="preprocessor">        while (_he_thh) {                                                        \</span></div>
<div class="line"><a name="l00724"></a><span class="lineno">  724</span>&#160;<span class="preprocessor">           _he_hh_nxt = _he_thh-&gt;hh_next;                                        \</span></div>
<div class="line"><a name="l00725"></a><span class="lineno">  725</span>&#160;<span class="preprocessor">           HASH_TO_BKT( _he_thh-&gt;hashv, tbl-&gt;num_buckets*2, _he_bkt);            \</span></div>
<div class="line"><a name="l00726"></a><span class="lineno">  726</span>&#160;<span class="preprocessor">           _he_newbkt = &amp;(_he_new_buckets[ _he_bkt ]);                           \</span></div>
<div class="line"><a name="l00727"></a><span class="lineno">  727</span>&#160;<span class="preprocessor">           if (++(_he_newbkt-&gt;count) &gt; tbl-&gt;ideal_chain_maxlen) {                \</span></div>
<div class="line"><a name="l00728"></a><span class="lineno">  728</span>&#160;<span class="preprocessor">             tbl-&gt;nonideal_items++;                                              \</span></div>
<div class="line"><a name="l00729"></a><span class="lineno">  729</span>&#160;<span class="preprocessor">             _he_newbkt-&gt;expand_mult = _he_newbkt-&gt;count /                       \</span></div>
<div class="line"><a name="l00730"></a><span class="lineno">  730</span>&#160;<span class="preprocessor">                                        tbl-&gt;ideal_chain_maxlen;                 \</span></div>
<div class="line"><a name="l00731"></a><span class="lineno">  731</span>&#160;<span class="preprocessor">           }                                                                     \</span></div>
<div class="line"><a name="l00732"></a><span class="lineno">  732</span>&#160;<span class="preprocessor">           _he_thh-&gt;hh_prev = NULL;                                              \</span></div>
<div class="line"><a name="l00733"></a><span class="lineno">  733</span>&#160;<span class="preprocessor">           _he_thh-&gt;hh_next = _he_newbkt-&gt;hh_head;                               \</span></div>
<div class="line"><a name="l00734"></a><span class="lineno">  734</span>&#160;<span class="preprocessor">           if (_he_newbkt-&gt;hh_head) _he_newbkt-&gt;hh_head-&gt;hh_prev =               \</span></div>
<div class="line"><a name="l00735"></a><span class="lineno">  735</span>&#160;<span class="preprocessor">                _he_thh;                                                         \</span></div>
<div class="line"><a name="l00736"></a><span class="lineno">  736</span>&#160;<span class="preprocessor">           _he_newbkt-&gt;hh_head = _he_thh;                                        \</span></div>
<div class="line"><a name="l00737"></a><span class="lineno">  737</span>&#160;<span class="preprocessor">           _he_thh = _he_hh_nxt;                                                 \</span></div>
<div class="line"><a name="l00738"></a><span class="lineno">  738</span>&#160;<span class="preprocessor">        }                                                                        \</span></div>
<div class="line"><a name="l00739"></a><span class="lineno">  739</span>&#160;<span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a name="l00740"></a><span class="lineno">  740</span>&#160;<span class="preprocessor">    uthash_free( tbl-&gt;buckets, tbl-&gt;num_buckets*sizeof(struct UT_hash_bucket) ); \</span></div>
<div class="line"><a name="l00741"></a><span class="lineno">  741</span>&#160;<span class="preprocessor">    tbl-&gt;num_buckets *= 2;                                                       \</span></div>
<div class="line"><a name="l00742"></a><span class="lineno">  742</span>&#160;<span class="preprocessor">    tbl-&gt;log2_num_buckets++;                                                     \</span></div>
<div class="line"><a name="l00743"></a><span class="lineno">  743</span>&#160;<span class="preprocessor">    tbl-&gt;buckets = _he_new_buckets;                                              \</span></div>
<div class="line"><a name="l00744"></a><span class="lineno">  744</span>&#160;<span class="preprocessor">    tbl-&gt;ineff_expands = (tbl-&gt;nonideal_items &gt; (tbl-&gt;num_items &gt;&gt; 1)) ?         \</span></div>
<div class="line"><a name="l00745"></a><span class="lineno">  745</span>&#160;<span class="preprocessor">        (tbl-&gt;ineff_expands+1) : 0;                                              \</span></div>
<div class="line"><a name="l00746"></a><span class="lineno">  746</span>&#160;<span class="preprocessor">    if (tbl-&gt;ineff_expands &gt; 1) {                                                \</span></div>
<div class="line"><a name="l00747"></a><span class="lineno">  747</span>&#160;<span class="preprocessor">        tbl-&gt;noexpand=1;                                                         \</span></div>
<div class="line"><a name="l00748"></a><span class="lineno">  748</span>&#160;<span class="preprocessor">        uthash_noexpand_fyi(tbl);                                                \</span></div>
<div class="line"><a name="l00749"></a><span class="lineno">  749</span>&#160;<span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a name="l00750"></a><span class="lineno">  750</span>&#160;<span class="preprocessor">    uthash_expand_fyi(tbl);                                                      \</span></div>
<div class="line"><a name="l00751"></a><span class="lineno">  751</span>&#160;<span class="preprocessor">} while(0)</span></div>
<div class="line"><a name="l00752"></a><span class="lineno">  752</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00753"></a><span class="lineno">  753</span>&#160;</div>
<div class="line"><a name="l00754"></a><span class="lineno">  754</span>&#160;<span class="comment">/* This is an adaptation of Simon Tatham&#39;s O(n log(n)) mergesort */</span></div>
<div class="line"><a name="l00755"></a><span class="lineno">  755</span>&#160;<span class="comment">/* Note that HASH_SORT assumes the hash handle name to be hh. </span></div>
<div class="line"><a name="l00756"></a><span class="lineno">  756</span>&#160;<span class="comment"> * HASH_SRT was added to allow the hash handle name to be passed in. */</span></div>
<div class="line"><a name="l00757"></a><span class="lineno"><a class="line" href="uthash_8h.html#a88d2ab40956878caacd02c214f7e8f15">  757</a></span>&#160;<span class="preprocessor">#define HASH_SORT(head,cmpfcn) HASH_SRT(hh,head,cmpfcn)</span></div>
<div class="line"><a name="l00758"></a><span class="lineno"><a class="line" href="uthash_8h.html#a388b4071dcff005154f431d3d3025fbd">  758</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_SRT(hh,head,cmpfcn)                                                 \</span></div>
<div class="line"><a name="l00759"></a><span class="lineno">  759</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00760"></a><span class="lineno">  760</span>&#160;<span class="preprocessor">  unsigned _hs_i;                                                                \</span></div>
<div class="line"><a name="l00761"></a><span class="lineno">  761</span>&#160;<span class="preprocessor">  unsigned _hs_looping,_hs_nmerges,_hs_insize,_hs_psize,_hs_qsize;               \</span></div>
<div class="line"><a name="l00762"></a><span class="lineno">  762</span>&#160;<span class="preprocessor">  struct UT_hash_handle *_hs_p, *_hs_q, *_hs_e, *_hs_list, *_hs_tail;            \</span></div>
<div class="line"><a name="l00763"></a><span class="lineno">  763</span>&#160;<span class="preprocessor">  if (head) {                                                                    \</span></div>
<div class="line"><a name="l00764"></a><span class="lineno">  764</span>&#160;<span class="preprocessor">      _hs_insize = 1;                                                            \</span></div>
<div class="line"><a name="l00765"></a><span class="lineno">  765</span>&#160;<span class="preprocessor">      _hs_looping = 1;                                                           \</span></div>
<div class="line"><a name="l00766"></a><span class="lineno">  766</span>&#160;<span class="preprocessor">      _hs_list = &amp;((head)-&gt;hh);                                                  \</span></div>
<div class="line"><a name="l00767"></a><span class="lineno">  767</span>&#160;<span class="preprocessor">      while (_hs_looping) {                                                      \</span></div>
<div class="line"><a name="l00768"></a><span class="lineno">  768</span>&#160;<span class="preprocessor">          _hs_p = _hs_list;                                                      \</span></div>
<div class="line"><a name="l00769"></a><span class="lineno">  769</span>&#160;<span class="preprocessor">          _hs_list = NULL;                                                       \</span></div>
<div class="line"><a name="l00770"></a><span class="lineno">  770</span>&#160;<span class="preprocessor">          _hs_tail = NULL;                                                       \</span></div>
<div class="line"><a name="l00771"></a><span class="lineno">  771</span>&#160;<span class="preprocessor">          _hs_nmerges = 0;                                                       \</span></div>
<div class="line"><a name="l00772"></a><span class="lineno">  772</span>&#160;<span class="preprocessor">          while (_hs_p) {                                                        \</span></div>
<div class="line"><a name="l00773"></a><span class="lineno">  773</span>&#160;<span class="preprocessor">              _hs_nmerges++;                                                     \</span></div>
<div class="line"><a name="l00774"></a><span class="lineno">  774</span>&#160;<span class="preprocessor">              _hs_q = _hs_p;                                                     \</span></div>
<div class="line"><a name="l00775"></a><span class="lineno">  775</span>&#160;<span class="preprocessor">              _hs_psize = 0;                                                     \</span></div>
<div class="line"><a name="l00776"></a><span class="lineno">  776</span>&#160;<span class="preprocessor">              for ( _hs_i = 0; _hs_i  &lt; _hs_insize; _hs_i++ ) {                  \</span></div>
<div class="line"><a name="l00777"></a><span class="lineno">  777</span>&#160;<span class="preprocessor">                  _hs_psize++;                                                   \</span></div>
<div class="line"><a name="l00778"></a><span class="lineno">  778</span>&#160;<span class="preprocessor">                  _hs_q = (UT_hash_handle*)((_hs_q-&gt;next) ?                      \</span></div>
<div class="line"><a name="l00779"></a><span class="lineno">  779</span>&#160;<span class="preprocessor">                          ((void*)((char*)(_hs_q-&gt;next) +                        \</span></div>
<div class="line"><a name="l00780"></a><span class="lineno">  780</span>&#160;<span class="preprocessor">                          (head)-&gt;hh.tbl-&gt;hho)) : NULL);                         \</span></div>
<div class="line"><a name="l00781"></a><span class="lineno">  781</span>&#160;<span class="preprocessor">                  if (! (_hs_q) ) break;                                         \</span></div>
<div class="line"><a name="l00782"></a><span class="lineno">  782</span>&#160;<span class="preprocessor">              }                                                                  \</span></div>
<div class="line"><a name="l00783"></a><span class="lineno">  783</span>&#160;<span class="preprocessor">              _hs_qsize = _hs_insize;                                            \</span></div>
<div class="line"><a name="l00784"></a><span class="lineno">  784</span>&#160;<span class="preprocessor">              while ((_hs_psize &gt; 0) || ((_hs_qsize &gt; 0) &amp;&amp; _hs_q )) {           \</span></div>
<div class="line"><a name="l00785"></a><span class="lineno">  785</span>&#160;<span class="preprocessor">                  if (_hs_psize == 0) {                                          \</span></div>
<div class="line"><a name="l00786"></a><span class="lineno">  786</span>&#160;<span class="preprocessor">                      _hs_e = _hs_q;                                             \</span></div>
<div class="line"><a name="l00787"></a><span class="lineno">  787</span>&#160;<span class="preprocessor">                      _hs_q = (UT_hash_handle*)((_hs_q-&gt;next) ?                  \</span></div>
<div class="line"><a name="l00788"></a><span class="lineno">  788</span>&#160;<span class="preprocessor">                              ((void*)((char*)(_hs_q-&gt;next) +                    \</span></div>
<div class="line"><a name="l00789"></a><span class="lineno">  789</span>&#160;<span class="preprocessor">                              (head)-&gt;hh.tbl-&gt;hho)) : NULL);                     \</span></div>
<div class="line"><a name="l00790"></a><span class="lineno">  790</span>&#160;<span class="preprocessor">                      _hs_qsize--;                                               \</span></div>
<div class="line"><a name="l00791"></a><span class="lineno">  791</span>&#160;<span class="preprocessor">                  } else if ( (_hs_qsize == 0) || !(_hs_q) ) {                   \</span></div>
<div class="line"><a name="l00792"></a><span class="lineno">  792</span>&#160;<span class="preprocessor">                      _hs_e = _hs_p;                                             \</span></div>
<div class="line"><a name="l00793"></a><span class="lineno">  793</span>&#160;<span class="preprocessor">                      _hs_p = (UT_hash_handle*)((_hs_p-&gt;next) ?                  \</span></div>
<div class="line"><a name="l00794"></a><span class="lineno">  794</span>&#160;<span class="preprocessor">                              ((void*)((char*)(_hs_p-&gt;next) +                    \</span></div>
<div class="line"><a name="l00795"></a><span class="lineno">  795</span>&#160;<span class="preprocessor">                              (head)-&gt;hh.tbl-&gt;hho)) : NULL);                     \</span></div>
<div class="line"><a name="l00796"></a><span class="lineno">  796</span>&#160;<span class="preprocessor">                      _hs_psize--;                                               \</span></div>
<div class="line"><a name="l00797"></a><span class="lineno">  797</span>&#160;<span class="preprocessor">                  } else if ((                                                   \</span></div>
<div class="line"><a name="l00798"></a><span class="lineno">  798</span>&#160;<span class="preprocessor">                      cmpfcn(DECLTYPE(head)(ELMT_FROM_HH((head)-&gt;hh.tbl,_hs_p)), \</span></div>
<div class="line"><a name="l00799"></a><span class="lineno">  799</span>&#160;<span class="preprocessor">                             DECLTYPE(head)(ELMT_FROM_HH((head)-&gt;hh.tbl,_hs_q))) \</span></div>
<div class="line"><a name="l00800"></a><span class="lineno">  800</span>&#160;<span class="preprocessor">                             ) &lt;= 0) {                                           \</span></div>
<div class="line"><a name="l00801"></a><span class="lineno">  801</span>&#160;<span class="preprocessor">                      _hs_e = _hs_p;                                             \</span></div>
<div class="line"><a name="l00802"></a><span class="lineno">  802</span>&#160;<span class="preprocessor">                      _hs_p = (UT_hash_handle*)((_hs_p-&gt;next) ?                  \</span></div>
<div class="line"><a name="l00803"></a><span class="lineno">  803</span>&#160;<span class="preprocessor">                              ((void*)((char*)(_hs_p-&gt;next) +                    \</span></div>
<div class="line"><a name="l00804"></a><span class="lineno">  804</span>&#160;<span class="preprocessor">                              (head)-&gt;hh.tbl-&gt;hho)) : NULL);                     \</span></div>
<div class="line"><a name="l00805"></a><span class="lineno">  805</span>&#160;<span class="preprocessor">                      _hs_psize--;                                               \</span></div>
<div class="line"><a name="l00806"></a><span class="lineno">  806</span>&#160;<span class="preprocessor">                  } else {                                                       \</span></div>
<div class="line"><a name="l00807"></a><span class="lineno">  807</span>&#160;<span class="preprocessor">                      _hs_e = _hs_q;                                             \</span></div>
<div class="line"><a name="l00808"></a><span class="lineno">  808</span>&#160;<span class="preprocessor">                      _hs_q = (UT_hash_handle*)((_hs_q-&gt;next) ?                  \</span></div>
<div class="line"><a name="l00809"></a><span class="lineno">  809</span>&#160;<span class="preprocessor">                              ((void*)((char*)(_hs_q-&gt;next) +                    \</span></div>
<div class="line"><a name="l00810"></a><span class="lineno">  810</span>&#160;<span class="preprocessor">                              (head)-&gt;hh.tbl-&gt;hho)) : NULL);                     \</span></div>
<div class="line"><a name="l00811"></a><span class="lineno">  811</span>&#160;<span class="preprocessor">                      _hs_qsize--;                                               \</span></div>
<div class="line"><a name="l00812"></a><span class="lineno">  812</span>&#160;<span class="preprocessor">                  }                                                              \</span></div>
<div class="line"><a name="l00813"></a><span class="lineno">  813</span>&#160;<span class="preprocessor">                  if ( _hs_tail ) {                                              \</span></div>
<div class="line"><a name="l00814"></a><span class="lineno">  814</span>&#160;<span class="preprocessor">                      _hs_tail-&gt;next = ((_hs_e) ?                                \</span></div>
<div class="line"><a name="l00815"></a><span class="lineno">  815</span>&#160;<span class="preprocessor">                            ELMT_FROM_HH((head)-&gt;hh.tbl,_hs_e) : NULL);          \</span></div>
<div class="line"><a name="l00816"></a><span class="lineno">  816</span>&#160;<span class="preprocessor">                  } else {                                                       \</span></div>
<div class="line"><a name="l00817"></a><span class="lineno">  817</span>&#160;<span class="preprocessor">                      _hs_list = _hs_e;                                          \</span></div>
<div class="line"><a name="l00818"></a><span class="lineno">  818</span>&#160;<span class="preprocessor">                  }                                                              \</span></div>
<div class="line"><a name="l00819"></a><span class="lineno">  819</span>&#160;<span class="preprocessor">                  _hs_e-&gt;prev = ((_hs_tail) ?                                    \</span></div>
<div class="line"><a name="l00820"></a><span class="lineno">  820</span>&#160;<span class="preprocessor">                     ELMT_FROM_HH((head)-&gt;hh.tbl,_hs_tail) : NULL);              \</span></div>
<div class="line"><a name="l00821"></a><span class="lineno">  821</span>&#160;<span class="preprocessor">                  _hs_tail = _hs_e;                                              \</span></div>
<div class="line"><a name="l00822"></a><span class="lineno">  822</span>&#160;<span class="preprocessor">              }                                                                  \</span></div>
<div class="line"><a name="l00823"></a><span class="lineno">  823</span>&#160;<span class="preprocessor">              _hs_p = _hs_q;                                                     \</span></div>
<div class="line"><a name="l00824"></a><span class="lineno">  824</span>&#160;<span class="preprocessor">          }                                                                      \</span></div>
<div class="line"><a name="l00825"></a><span class="lineno">  825</span>&#160;<span class="preprocessor">          _hs_tail-&gt;next = NULL;                                                 \</span></div>
<div class="line"><a name="l00826"></a><span class="lineno">  826</span>&#160;<span class="preprocessor">          if ( _hs_nmerges &lt;= 1 ) {                                              \</span></div>
<div class="line"><a name="l00827"></a><span class="lineno">  827</span>&#160;<span class="preprocessor">              _hs_looping=0;                                                     \</span></div>
<div class="line"><a name="l00828"></a><span class="lineno">  828</span>&#160;<span class="preprocessor">              (head)-&gt;hh.tbl-&gt;tail = _hs_tail;                                   \</span></div>
<div class="line"><a name="l00829"></a><span class="lineno">  829</span>&#160;<span class="preprocessor">              DECLTYPE_ASSIGN(head,ELMT_FROM_HH((head)-&gt;hh.tbl, _hs_list));      \</span></div>
<div class="line"><a name="l00830"></a><span class="lineno">  830</span>&#160;<span class="preprocessor">          }                                                                      \</span></div>
<div class="line"><a name="l00831"></a><span class="lineno">  831</span>&#160;<span class="preprocessor">          _hs_insize *= 2;                                                       \</span></div>
<div class="line"><a name="l00832"></a><span class="lineno">  832</span>&#160;<span class="preprocessor">      }                                                                          \</span></div>
<div class="line"><a name="l00833"></a><span class="lineno">  833</span>&#160;<span class="preprocessor">      HASH_FSCK(hh,head);                                                        \</span></div>
<div class="line"><a name="l00834"></a><span class="lineno">  834</span>&#160;<span class="preprocessor"> }                                                                               \</span></div>
<div class="line"><a name="l00835"></a><span class="lineno">  835</span>&#160;<span class="preprocessor">} while (0)</span></div>
<div class="line"><a name="l00836"></a><span class="lineno">  836</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00837"></a><span class="lineno">  837</span>&#160;<span class="comment">/* This function selects items from one hash into another hash. </span></div>
<div class="line"><a name="l00838"></a><span class="lineno">  838</span>&#160;<span class="comment"> * The end result is that the selected items have dual presence </span></div>
<div class="line"><a name="l00839"></a><span class="lineno">  839</span>&#160;<span class="comment"> * in both hashes. There is no copy of the items made; rather </span></div>
<div class="line"><a name="l00840"></a><span class="lineno">  840</span>&#160;<span class="comment"> * they are added into the new hash through a secondary hash </span></div>
<div class="line"><a name="l00841"></a><span class="lineno">  841</span>&#160;<span class="comment"> * hash handle that must be present in the structure. */</span></div>
<div class="line"><a name="l00842"></a><span class="lineno"><a class="line" href="uthash_8h.html#ad190366f7a476ece79bd628240a5fc93">  842</a></span>&#160;<span class="preprocessor">#define HASH_SELECT(hh_dst, dst, hh_src, src, cond)                              \</span></div>
<div class="line"><a name="l00843"></a><span class="lineno">  843</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00844"></a><span class="lineno">  844</span>&#160;<span class="preprocessor">  unsigned _src_bkt, _dst_bkt;                                                   \</span></div>
<div class="line"><a name="l00845"></a><span class="lineno">  845</span>&#160;<span class="preprocessor">  void *_last_elt=NULL, *_elt;                                                   \</span></div>
<div class="line"><a name="l00846"></a><span class="lineno">  846</span>&#160;<span class="preprocessor">  UT_hash_handle *_src_hh, *_dst_hh, *_last_elt_hh=NULL;                         \</span></div>
<div class="line"><a name="l00847"></a><span class="lineno">  847</span>&#160;<span class="preprocessor">  ptrdiff_t _dst_hho = ((char*)(&amp;(dst)-&gt;hh_dst) - (char*)(dst));                 \</span></div>
<div class="line"><a name="l00848"></a><span class="lineno">  848</span>&#160;<span class="preprocessor">  if (src) {                                                                     \</span></div>
<div class="line"><a name="l00849"></a><span class="lineno">  849</span>&#160;<span class="preprocessor">    for(_src_bkt=0; _src_bkt &lt; (src)-&gt;hh_src.tbl-&gt;num_buckets; _src_bkt++) {     \</span></div>
<div class="line"><a name="l00850"></a><span class="lineno">  850</span>&#160;<span class="preprocessor">      for(_src_hh = (src)-&gt;hh_src.tbl-&gt;buckets[_src_bkt].hh_head;                \</span></div>
<div class="line"><a name="l00851"></a><span class="lineno">  851</span>&#160;<span class="preprocessor">          _src_hh;                                                               \</span></div>
<div class="line"><a name="l00852"></a><span class="lineno">  852</span>&#160;<span class="preprocessor">          _src_hh = _src_hh-&gt;hh_next) {                                          \</span></div>
<div class="line"><a name="l00853"></a><span class="lineno">  853</span>&#160;<span class="preprocessor">          _elt = ELMT_FROM_HH((src)-&gt;hh_src.tbl, _src_hh);                       \</span></div>
<div class="line"><a name="l00854"></a><span class="lineno">  854</span>&#160;<span class="preprocessor">          if (cond(_elt)) {                                                      \</span></div>
<div class="line"><a name="l00855"></a><span class="lineno">  855</span>&#160;<span class="preprocessor">            _dst_hh = (UT_hash_handle*)(((char*)_elt) + _dst_hho);               \</span></div>
<div class="line"><a name="l00856"></a><span class="lineno">  856</span>&#160;<span class="preprocessor">            _dst_hh-&gt;key = _src_hh-&gt;key;                                         \</span></div>
<div class="line"><a name="l00857"></a><span class="lineno">  857</span>&#160;<span class="preprocessor">            _dst_hh-&gt;keylen = _src_hh-&gt;keylen;                                   \</span></div>
<div class="line"><a name="l00858"></a><span class="lineno">  858</span>&#160;<span class="preprocessor">            _dst_hh-&gt;hashv = _src_hh-&gt;hashv;                                     \</span></div>
<div class="line"><a name="l00859"></a><span class="lineno">  859</span>&#160;<span class="preprocessor">            _dst_hh-&gt;prev = _last_elt;                                           \</span></div>
<div class="line"><a name="l00860"></a><span class="lineno">  860</span>&#160;<span class="preprocessor">            _dst_hh-&gt;next = NULL;                                                \</span></div>
<div class="line"><a name="l00861"></a><span class="lineno">  861</span>&#160;<span class="preprocessor">            if (_last_elt_hh) { _last_elt_hh-&gt;next = _elt; }                     \</span></div>
<div class="line"><a name="l00862"></a><span class="lineno">  862</span>&#160;<span class="preprocessor">            if (!dst) {                                                          \</span></div>
<div class="line"><a name="l00863"></a><span class="lineno">  863</span>&#160;<span class="preprocessor">              DECLTYPE_ASSIGN(dst,_elt);                                         \</span></div>
<div class="line"><a name="l00864"></a><span class="lineno">  864</span>&#160;<span class="preprocessor">              HASH_MAKE_TABLE(hh_dst,dst);                                       \</span></div>
<div class="line"><a name="l00865"></a><span class="lineno">  865</span>&#160;<span class="preprocessor">            } else {                                                             \</span></div>
<div class="line"><a name="l00866"></a><span class="lineno">  866</span>&#160;<span class="preprocessor">              _dst_hh-&gt;tbl = (dst)-&gt;hh_dst.tbl;                                  \</span></div>
<div class="line"><a name="l00867"></a><span class="lineno">  867</span>&#160;<span class="preprocessor">            }                                                                    \</span></div>
<div class="line"><a name="l00868"></a><span class="lineno">  868</span>&#160;<span class="preprocessor">            HASH_TO_BKT(_dst_hh-&gt;hashv, _dst_hh-&gt;tbl-&gt;num_buckets, _dst_bkt);    \</span></div>
<div class="line"><a name="l00869"></a><span class="lineno">  869</span>&#160;<span class="preprocessor">            HASH_ADD_TO_BKT(_dst_hh-&gt;tbl-&gt;buckets[_dst_bkt],_dst_hh);            \</span></div>
<div class="line"><a name="l00870"></a><span class="lineno">  870</span>&#160;<span class="preprocessor">            (dst)-&gt;hh_dst.tbl-&gt;num_items++;                                      \</span></div>
<div class="line"><a name="l00871"></a><span class="lineno">  871</span>&#160;<span class="preprocessor">            _last_elt = _elt;                                                    \</span></div>
<div class="line"><a name="l00872"></a><span class="lineno">  872</span>&#160;<span class="preprocessor">            _last_elt_hh = _dst_hh;                                              \</span></div>
<div class="line"><a name="l00873"></a><span class="lineno">  873</span>&#160;<span class="preprocessor">          }                                                                      \</span></div>
<div class="line"><a name="l00874"></a><span class="lineno">  874</span>&#160;<span class="preprocessor">      }                                                                          \</span></div>
<div class="line"><a name="l00875"></a><span class="lineno">  875</span>&#160;<span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a name="l00876"></a><span class="lineno">  876</span>&#160;<span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a name="l00877"></a><span class="lineno">  877</span>&#160;<span class="preprocessor">  HASH_FSCK(hh_dst,dst);                                                         \</span></div>
<div class="line"><a name="l00878"></a><span class="lineno">  878</span>&#160;<span class="preprocessor">} while (0)</span></div>
<div class="line"><a name="l00879"></a><span class="lineno">  879</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00880"></a><span class="lineno"><a class="line" href="uthash_8h.html#a0512b3f7a824275579ec82643ef2cc23">  880</a></span>&#160;<span class="preprocessor">#define HASH_CLEAR(hh,head)                                                      \</span></div>
<div class="line"><a name="l00881"></a><span class="lineno">  881</span>&#160;<span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a name="l00882"></a><span class="lineno">  882</span>&#160;<span class="preprocessor">  if (head) {                                                                    \</span></div>
<div class="line"><a name="l00883"></a><span class="lineno">  883</span>&#160;<span class="preprocessor">    uthash_free((head)-&gt;hh.tbl-&gt;buckets,                                         \</span></div>
<div class="line"><a name="l00884"></a><span class="lineno">  884</span>&#160;<span class="preprocessor">                (head)-&gt;hh.tbl-&gt;num_buckets*sizeof(struct UT_hash_bucket));      \</span></div>
<div class="line"><a name="l00885"></a><span class="lineno">  885</span>&#160;<span class="preprocessor">    uthash_free((head)-&gt;hh.tbl, sizeof(UT_hash_table));                          \</span></div>
<div class="line"><a name="l00886"></a><span class="lineno">  886</span>&#160;<span class="preprocessor">    (head)=NULL;                                                                 \</span></div>
<div class="line"><a name="l00887"></a><span class="lineno">  887</span>&#160;<span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a name="l00888"></a><span class="lineno">  888</span>&#160;<span class="preprocessor">} while(0)</span></div>
<div class="line"><a name="l00889"></a><span class="lineno">  889</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00890"></a><span class="lineno">  890</span>&#160;<span class="preprocessor">#ifdef NO_DECLTYPE</span></div>
<div class="line"><a name="l00891"></a><span class="lineno">  891</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_ITER(hh,head,el,tmp)                                                \</span></div>
<div class="line"><a name="l00892"></a><span class="lineno">  892</span>&#160;<span class="preprocessor">for((el)=(head), (*(char**)(&amp;(tmp)))=(char*)((head)?(head)-&gt;hh.next:NULL);       \</span></div>
<div class="line"><a name="l00893"></a><span class="lineno">  893</span>&#160;<span class="preprocessor">  el; (el)=(tmp),(*(char**)(&amp;(tmp)))=(char*)((tmp)?(tmp)-&gt;hh.next:NULL)) </span></div>
<div class="line"><a name="l00894"></a><span class="lineno">  894</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#else</span></div>
<div class="line"><a name="l00895"></a><span class="lineno"><a class="line" href="uthash_8h.html#a4d524042f1fcb976d8bccae9e4cc63d6">  895</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_ITER(hh,head,el,tmp)                                                \</span></div>
<div class="line"><a name="l00896"></a><span class="lineno">  896</span>&#160;<span class="preprocessor">for((el)=(head),(tmp)=DECLTYPE(el)((head)?(head)-&gt;hh.next:NULL);                 \</span></div>
<div class="line"><a name="l00897"></a><span class="lineno">  897</span>&#160;<span class="preprocessor">  el; (el)=(tmp),(tmp)=DECLTYPE(el)((tmp)?(tmp)-&gt;hh.next:NULL))</span></div>
<div class="line"><a name="l00898"></a><span class="lineno">  898</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00899"></a><span class="lineno">  899</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00900"></a><span class="lineno">  900</span>&#160;<span class="comment">/* obtain a count of items in the hash */</span></div>
<div class="line"><a name="l00901"></a><span class="lineno"><a class="line" href="uthash_8h.html#a7d3edf55a3ee4da1a0e1b477c314342f">  901</a></span>&#160;<span class="preprocessor">#define HASH_COUNT(head) HASH_CNT(hh,head) </span></div>
<div class="line"><a name="l00902"></a><span class="lineno"><a class="line" href="uthash_8h.html#a6ea9e661cd8c35eff1fdcd5731127edd">  902</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_CNT(hh,head) ((head)?((head)-&gt;hh.tbl-&gt;num_items):0)</span></div>
<div class="line"><a name="l00903"></a><span class="lineno">  903</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00904"></a><span class="lineno"><a class="line" href="structUT__hash__bucket.html">  904</a></span>&#160;<span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structUT__hash__bucket.html">UT_hash_bucket</a> {</div>
<div class="line"><a name="l00905"></a><span class="lineno"><a class="line" href="structUT__hash__bucket.html#a785a785132212378bb28fb4341cfecaf">  905</a></span>&#160;   <span class="keyword">struct </span><a class="code" href="structUT__hash__handle.html">UT_hash_handle</a> *<a class="code" href="structUT__hash__bucket.html#a785a785132212378bb28fb4341cfecaf">hh_head</a>;</div>
<div class="line"><a name="l00906"></a><span class="lineno"><a class="line" href="structUT__hash__bucket.html#a5d20cc12bdcbde360398910eefb45634">  906</a></span>&#160;   <span class="keywordtype">unsigned</span> <a class="code" href="structUT__hash__bucket.html#a5d20cc12bdcbde360398910eefb45634">count</a>;</div>
<div class="line"><a name="l00907"></a><span class="lineno">  907</span>&#160;</div>
<div class="line"><a name="l00908"></a><span class="lineno">  908</span>&#160;   <span class="comment">/* expand_mult is normally set to 0. In this situation, the max chain length</span></div>
<div class="line"><a name="l00909"></a><span class="lineno">  909</span>&#160;<span class="comment">    * threshold is enforced at its default value, HASH_BKT_CAPACITY_THRESH. (If</span></div>
<div class="line"><a name="l00910"></a><span class="lineno">  910</span>&#160;<span class="comment">    * the bucket&#39;s chain exceeds this length, bucket expansion is triggered). </span></div>
<div class="line"><a name="l00911"></a><span class="lineno">  911</span>&#160;<span class="comment">    * However, setting expand_mult to a non-zero value delays bucket expansion</span></div>
<div class="line"><a name="l00912"></a><span class="lineno">  912</span>&#160;<span class="comment">    * (that would be triggered by additions to this particular bucket)</span></div>
<div class="line"><a name="l00913"></a><span class="lineno">  913</span>&#160;<span class="comment">    * until its chain length reaches a *multiple* of HASH_BKT_CAPACITY_THRESH.</span></div>
<div class="line"><a name="l00914"></a><span class="lineno">  914</span>&#160;<span class="comment">    * (The multiplier is simply expand_mult+1). The whole idea of this</span></div>
<div class="line"><a name="l00915"></a><span class="lineno">  915</span>&#160;<span class="comment">    * multiplier is to reduce bucket expansions, since they are expensive, in</span></div>
<div class="line"><a name="l00916"></a><span class="lineno">  916</span>&#160;<span class="comment">    * situations where we know that a particular bucket tends to be overused.</span></div>
<div class="line"><a name="l00917"></a><span class="lineno">  917</span>&#160;<span class="comment">    * It is better to let its chain length grow to a longer yet-still-bounded</span></div>
<div class="line"><a name="l00918"></a><span class="lineno">  918</span>&#160;<span class="comment">    * value, than to do an O(n) bucket expansion too often. </span></div>
<div class="line"><a name="l00919"></a><span class="lineno">  919</span>&#160;<span class="comment">    */</span></div>
<div class="line"><a name="l00920"></a><span class="lineno"><a class="line" href="structUT__hash__bucket.html#a9b739c1b69c141e8198c0c64af643b2b">  920</a></span>&#160;   <span class="keywordtype">unsigned</span> <a class="code" href="structUT__hash__bucket.html#a9b739c1b69c141e8198c0c64af643b2b">expand_mult</a>;</div>
<div class="line"><a name="l00921"></a><span class="lineno">  921</span>&#160;</div>
<div class="line"><a name="l00922"></a><span class="lineno">  922</span>&#160;} <a class="code" href="uthash_8h.html#a3ba3da0ca59a082c35a0d6b52e803ddf">UT_hash_bucket</a>;</div>
<div class="line"><a name="l00923"></a><span class="lineno">  923</span>&#160;</div>
<div class="line"><a name="l00924"></a><span class="lineno">  924</span>&#160;<span class="comment">/* random signature used only to find hash tables in external analysis */</span></div>
<div class="line"><a name="l00925"></a><span class="lineno"><a class="line" href="uthash_8h.html#a4a7a46b9b92a9c73e4f9321e8e6b6bb2">  925</a></span>&#160;<span class="preprocessor">#define HASH_SIGNATURE 0xa0111fe1</span></div>
<div class="line"><a name="l00926"></a><span class="lineno"><a class="line" href="uthash_8h.html#a18a33f4269f05c1e81ce54edbc0ffca6">  926</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define HASH_BLOOM_SIGNATURE 0xb12220f2</span></div>
<div class="line"><a name="l00927"></a><span class="lineno">  927</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00928"></a><span class="lineno"><a class="line" href="structUT__hash__table.html">  928</a></span>&#160;<span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structUT__hash__table.html">UT_hash_table</a> {</div>
<div class="line"><a name="l00929"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#a04556bbef9c9a1c40b1bc0d17a2a6e0b">  929</a></span>&#160;   <a class="code" href="structUT__hash__bucket.html">UT_hash_bucket</a> *<a class="code" href="structUT__hash__table.html#a04556bbef9c9a1c40b1bc0d17a2a6e0b">buckets</a>;</div>
<div class="line"><a name="l00930"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#a3ed04b6233facaedf910672578d86339">  930</a></span>&#160;   <span class="keywordtype">unsigned</span> <a class="code" href="structUT__hash__table.html#a3ed04b6233facaedf910672578d86339">num_buckets</a>, <a class="code" href="structUT__hash__table.html#ae376a7f3fac525f3a9d03b6beec8d12f">log2_num_buckets</a>;</div>
<div class="line"><a name="l00931"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#a74534cc14f080c96f94d8f5da83d9d76">  931</a></span>&#160;   <span class="keywordtype">unsigned</span> <a class="code" href="structUT__hash__table.html#a74534cc14f080c96f94d8f5da83d9d76">num_items</a>;</div>
<div class="line"><a name="l00932"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#a00a889a5e1ebaeec0a83ec2701df1992">  932</a></span>&#160;   <span class="keyword">struct </span><a class="code" href="structUT__hash__handle.html">UT_hash_handle</a> *<a class="code" href="structUT__hash__table.html#a00a889a5e1ebaeec0a83ec2701df1992">tail</a>; <span class="comment">/* tail hh in app order, for fast append    */</span></div>
<div class="line"><a name="l00933"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#afd05f4d9e45354fb010367ae9e1bddb6">  933</a></span>&#160;   ptrdiff_t <a class="code" href="structUT__hash__table.html#afd05f4d9e45354fb010367ae9e1bddb6">hho</a>; <span class="comment">/* hash handle offset (byte pos of hash handle in element */</span></div>
<div class="line"><a name="l00934"></a><span class="lineno">  934</span>&#160;</div>
<div class="line"><a name="l00935"></a><span class="lineno">  935</span>&#160;   <span class="comment">/* in an ideal situation (all buckets used equally), no bucket would have</span></div>
<div class="line"><a name="l00936"></a><span class="lineno">  936</span>&#160;<span class="comment">    * more than ceil(#items/#buckets) items. that&#39;s the ideal chain length. */</span></div>
<div class="line"><a name="l00937"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#a5f1cec93d5d753ba02097c797e4d67ad">  937</a></span>&#160;   <span class="keywordtype">unsigned</span> <a class="code" href="structUT__hash__table.html#a5f1cec93d5d753ba02097c797e4d67ad">ideal_chain_maxlen</a>;</div>
<div class="line"><a name="l00938"></a><span class="lineno">  938</span>&#160;</div>
<div class="line"><a name="l00939"></a><span class="lineno">  939</span>&#160;   <span class="comment">/* nonideal_items is the number of items in the hash whose chain position</span></div>
<div class="line"><a name="l00940"></a><span class="lineno">  940</span>&#160;<span class="comment">    * exceeds the ideal chain maxlen. these items pay the penalty for an uneven</span></div>
<div class="line"><a name="l00941"></a><span class="lineno">  941</span>&#160;<span class="comment">    * hash distribution; reaching them in a chain traversal takes &gt;ideal steps */</span></div>
<div class="line"><a name="l00942"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#a8cb66cfb259a204cda59a815e4db664f">  942</a></span>&#160;   <span class="keywordtype">unsigned</span> <a class="code" href="structUT__hash__table.html#a8cb66cfb259a204cda59a815e4db664f">nonideal_items</a>;</div>
<div class="line"><a name="l00943"></a><span class="lineno">  943</span>&#160;</div>
<div class="line"><a name="l00944"></a><span class="lineno">  944</span>&#160;   <span class="comment">/* ineffective expands occur when a bucket doubling was performed, but </span></div>
<div class="line"><a name="l00945"></a><span class="lineno">  945</span>&#160;<span class="comment">    * afterward, more than half the items in the hash had nonideal chain</span></div>
<div class="line"><a name="l00946"></a><span class="lineno">  946</span>&#160;<span class="comment">    * positions. If this happens on two consecutive expansions we inhibit any</span></div>
<div class="line"><a name="l00947"></a><span class="lineno">  947</span>&#160;<span class="comment">    * further expansion, as it&#39;s not helping; this happens when the hash</span></div>
<div class="line"><a name="l00948"></a><span class="lineno">  948</span>&#160;<span class="comment">    * function isn&#39;t a good fit for the key domain. When expansion is inhibited</span></div>
<div class="line"><a name="l00949"></a><span class="lineno">  949</span>&#160;<span class="comment">    * the hash will still work, albeit no longer in constant time. */</span></div>
<div class="line"><a name="l00950"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#a635661789933752e7b83dac84430eae1">  950</a></span>&#160;   <span class="keywordtype">unsigned</span> <a class="code" href="structUT__hash__table.html#a216c7d98cf40a0064bee94aa8a5bf1b7">ineff_expands</a>, <a class="code" href="structUT__hash__table.html#a635661789933752e7b83dac84430eae1">noexpand</a>;</div>
<div class="line"><a name="l00951"></a><span class="lineno">  951</span>&#160;</div>
<div class="line"><a name="l00952"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#a87d1ab3f3ede1809c6a485972d20b25f">  952</a></span>&#160;   uint32_t <a class="code" href="structUT__hash__table.html#a87d1ab3f3ede1809c6a485972d20b25f">signature</a>; <span class="comment">/* used only to find hash tables in external analysis */</span></div>
<div class="line"><a name="l00953"></a><span class="lineno">  953</span>&#160;<span class="preprocessor">#ifdef HASH_BLOOM</span></div>
<div class="line"><a name="l00954"></a><span class="lineno">  954</span>&#160;<span class="preprocessor"></span>   uint32_t bloom_sig; <span class="comment">/* used only to test bloom exists in external analysis */</span></div>
<div class="line"><a name="l00955"></a><span class="lineno">  955</span>&#160;   uint8_t *bloom_bv;</div>
<div class="line"><a name="l00956"></a><span class="lineno">  956</span>&#160;   <span class="keywordtype">char</span> bloom_nbits;</div>
<div class="line"><a name="l00957"></a><span class="lineno">  957</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00958"></a><span class="lineno">  958</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00959"></a><span class="lineno">  959</span>&#160;} <a class="code" href="uthash_8h.html#a0758074b9942c2ad076610b3e0ce548e">UT_hash_table</a>;</div>
<div class="line"><a name="l00960"></a><span class="lineno">  960</span>&#160;</div>
<div class="line"><a name="l00961"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html">  961</a></span>&#160;<span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structUT__hash__handle.html">UT_hash_handle</a> {</div>
<div class="line"><a name="l00962"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html#ad2035ee3b2aa55b22e352341372a5e73">  962</a></span>&#160;   <span class="keyword">struct </span><a class="code" href="structUT__hash__table.html">UT_hash_table</a> *<a class="code" href="structUT__hash__handle.html#ad2035ee3b2aa55b22e352341372a5e73">tbl</a>;</div>
<div class="line"><a name="l00963"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html#abaf54a69367933df2d45575f48ca6a58">  963</a></span>&#160;   <span class="keywordtype">void</span> *<a class="code" href="structUT__hash__handle.html#abaf54a69367933df2d45575f48ca6a58">prev</a>;                       <span class="comment">/* prev element in app order      */</span></div>
<div class="line"><a name="l00964"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html#a93bc88ffe97f85ea0d9e0056b7118942">  964</a></span>&#160;   <span class="keywordtype">void</span> *<a class="code" href="structUT__hash__handle.html#a93bc88ffe97f85ea0d9e0056b7118942">next</a>;                       <span class="comment">/* next element in app order      */</span></div>
<div class="line"><a name="l00965"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html#a3ec03e34d7975d5c1981c44b324619b2">  965</a></span>&#160;   <span class="keyword">struct </span><a class="code" href="structUT__hash__handle.html">UT_hash_handle</a> *<a class="code" href="structUT__hash__handle.html#a3ec03e34d7975d5c1981c44b324619b2">hh_prev</a>;   <span class="comment">/* previous hh in bucket order    */</span></div>
<div class="line"><a name="l00966"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html#a4f6989385499ba6f594b0f0facd28325">  966</a></span>&#160;   <span class="keyword">struct </span><a class="code" href="structUT__hash__handle.html">UT_hash_handle</a> *<a class="code" href="structUT__hash__handle.html#a4f6989385499ba6f594b0f0facd28325">hh_next</a>;   <span class="comment">/* next hh in bucket order        */</span></div>
<div class="line"><a name="l00967"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html#a40690fc15aeaeba8f25385f05f84dd4d">  967</a></span>&#160;   <span class="keywordtype">void</span> *<a class="code" href="structUT__hash__handle.html#a40690fc15aeaeba8f25385f05f84dd4d">key</a>;                        <span class="comment">/* ptr to enclosing struct&#39;s key  */</span></div>
<div class="line"><a name="l00968"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html#af2abdc405972a6bbdee2ade2c0f346c4">  968</a></span>&#160;   <span class="keywordtype">unsigned</span> <a class="code" href="structUT__hash__handle.html#af2abdc405972a6bbdee2ade2c0f346c4">keylen</a>;                  <span class="comment">/* enclosing struct&#39;s key len     */</span></div>
<div class="line"><a name="l00969"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html#aae5e635fa110556e5007f627089f8323">  969</a></span>&#160;   <span class="keywordtype">unsigned</span> <a class="code" href="structUT__hash__handle.html#aae5e635fa110556e5007f627089f8323">hashv</a>;                   <span class="comment">/* result of hash-fcn(key)        */</span></div>
<div class="line"><a name="l00970"></a><span class="lineno">  970</span>&#160;} <a class="code" href="uthash_8h.html#a0e3a99ed9f776349720d0c362f956fb6">UT_hash_handle</a>;</div>
<div class="line"><a name="l00971"></a><span class="lineno">  971</span>&#160;</div>
<div class="line"><a name="l00972"></a><span class="lineno">  972</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/* _DTLS_UTHASH_H */</span><span class="preprocessor"></span></div>
<div class="ttc" id="structUT__hash__table_html_a216c7d98cf40a0064bee94aa8a5bf1b7"><div class="ttname"><a href="structUT__hash__table.html#a216c7d98cf40a0064bee94aa8a5bf1b7">UT_hash_table::ineff_expands</a></div><div class="ttdeci">unsigned ineff_expands</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00950">uthash.h:950</a></div></div>
<div class="ttc" id="structUT__hash__table_html_a00a889a5e1ebaeec0a83ec2701df1992"><div class="ttname"><a href="structUT__hash__table.html#a00a889a5e1ebaeec0a83ec2701df1992">UT_hash_table::tail</a></div><div class="ttdeci">struct UT_hash_handle * tail</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00932">uthash.h:932</a></div></div>
<div class="ttc" id="structUT__hash__table_html_a04556bbef9c9a1c40b1bc0d17a2a6e0b"><div class="ttname"><a href="structUT__hash__table.html#a04556bbef9c9a1c40b1bc0d17a2a6e0b">UT_hash_table::buckets</a></div><div class="ttdeci">UT_hash_bucket * buckets</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00929">uthash.h:929</a></div></div>
<div class="ttc" id="structUT__hash__bucket_html_a9b739c1b69c141e8198c0c64af643b2b"><div class="ttname"><a href="structUT__hash__bucket.html#a9b739c1b69c141e8198c0c64af643b2b">UT_hash_bucket::expand_mult</a></div><div class="ttdeci">unsigned expand_mult</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00920">uthash.h:920</a></div></div>
<div class="ttc" id="structUT__hash__bucket_html_a785a785132212378bb28fb4341cfecaf"><div class="ttname"><a href="structUT__hash__bucket.html#a785a785132212378bb28fb4341cfecaf">UT_hash_bucket::hh_head</a></div><div class="ttdeci">struct UT_hash_handle * hh_head</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00905">uthash.h:905</a></div></div>
<div class="ttc" id="structUT__hash__table_html_ae376a7f3fac525f3a9d03b6beec8d12f"><div class="ttname"><a href="structUT__hash__table.html#ae376a7f3fac525f3a9d03b6beec8d12f">UT_hash_table::log2_num_buckets</a></div><div class="ttdeci">unsigned log2_num_buckets</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00930">uthash.h:930</a></div></div>
<div class="ttc" id="structUT__hash__handle_html_a4f6989385499ba6f594b0f0facd28325"><div class="ttname"><a href="structUT__hash__handle.html#a4f6989385499ba6f594b0f0facd28325">UT_hash_handle::hh_next</a></div><div class="ttdeci">struct UT_hash_handle * hh_next</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00966">uthash.h:966</a></div></div>
<div class="ttc" id="structUT__hash__bucket_html_a5d20cc12bdcbde360398910eefb45634"><div class="ttname"><a href="structUT__hash__bucket.html#a5d20cc12bdcbde360398910eefb45634">UT_hash_bucket::count</a></div><div class="ttdeci">unsigned count</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00906">uthash.h:906</a></div></div>
<div class="ttc" id="structUT__hash__handle_html"><div class="ttname"><a href="structUT__hash__handle.html">UT_hash_handle</a></div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00961">uthash.h:961</a></div></div>
<div class="ttc" id="structUT__hash__table_html_a635661789933752e7b83dac84430eae1"><div class="ttname"><a href="structUT__hash__table.html#a635661789933752e7b83dac84430eae1">UT_hash_table::noexpand</a></div><div class="ttdeci">unsigned noexpand</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00950">uthash.h:950</a></div></div>
<div class="ttc" id="structUT__hash__handle_html_af2abdc405972a6bbdee2ade2c0f346c4"><div class="ttname"><a href="structUT__hash__handle.html#af2abdc405972a6bbdee2ade2c0f346c4">UT_hash_handle::keylen</a></div><div class="ttdeci">unsigned keylen</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00968">uthash.h:968</a></div></div>
<div class="ttc" id="structUT__hash__table_html_a8cb66cfb259a204cda59a815e4db664f"><div class="ttname"><a href="structUT__hash__table.html#a8cb66cfb259a204cda59a815e4db664f">UT_hash_table::nonideal_items</a></div><div class="ttdeci">unsigned nonideal_items</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00942">uthash.h:942</a></div></div>
<div class="ttc" id="structUT__hash__table_html_afd05f4d9e45354fb010367ae9e1bddb6"><div class="ttname"><a href="structUT__hash__table.html#afd05f4d9e45354fb010367ae9e1bddb6">UT_hash_table::hho</a></div><div class="ttdeci">ptrdiff_t hho</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00933">uthash.h:933</a></div></div>
<div class="ttc" id="structUT__hash__table_html_a3ed04b6233facaedf910672578d86339"><div class="ttname"><a href="structUT__hash__table.html#a3ed04b6233facaedf910672578d86339">UT_hash_table::num_buckets</a></div><div class="ttdeci">unsigned num_buckets</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00930">uthash.h:930</a></div></div>
<div class="ttc" id="structUT__hash__table_html"><div class="ttname"><a href="structUT__hash__table.html">UT_hash_table</a></div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00928">uthash.h:928</a></div></div>
<div class="ttc" id="uthash_8h_html_a3ba3da0ca59a082c35a0d6b52e803ddf"><div class="ttname"><a href="uthash_8h.html#a3ba3da0ca59a082c35a0d6b52e803ddf">UT_hash_bucket</a></div><div class="ttdeci">struct UT_hash_bucket UT_hash_bucket</div></div>
<div class="ttc" id="structUT__hash__handle_html_aae5e635fa110556e5007f627089f8323"><div class="ttname"><a href="structUT__hash__handle.html#aae5e635fa110556e5007f627089f8323">UT_hash_handle::hashv</a></div><div class="ttdeci">unsigned hashv</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00969">uthash.h:969</a></div></div>
<div class="ttc" id="structUT__hash__handle_html_a40690fc15aeaeba8f25385f05f84dd4d"><div class="ttname"><a href="structUT__hash__handle.html#a40690fc15aeaeba8f25385f05f84dd4d">UT_hash_handle::key</a></div><div class="ttdeci">void * key</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00967">uthash.h:967</a></div></div>
<div class="ttc" id="structUT__hash__handle_html_ad2035ee3b2aa55b22e352341372a5e73"><div class="ttname"><a href="structUT__hash__handle.html#ad2035ee3b2aa55b22e352341372a5e73">UT_hash_handle::tbl</a></div><div class="ttdeci">struct UT_hash_table * tbl</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00962">uthash.h:962</a></div></div>
<div class="ttc" id="structUT__hash__table_html_a87d1ab3f3ede1809c6a485972d20b25f"><div class="ttname"><a href="structUT__hash__table.html#a87d1ab3f3ede1809c6a485972d20b25f">UT_hash_table::signature</a></div><div class="ttdeci">uint32_t signature</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00952">uthash.h:952</a></div></div>
<div class="ttc" id="structUT__hash__bucket_html"><div class="ttname"><a href="structUT__hash__bucket.html">UT_hash_bucket</a></div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00904">uthash.h:904</a></div></div>
<div class="ttc" id="uthash_8h_html_a0758074b9942c2ad076610b3e0ce548e"><div class="ttname"><a href="uthash_8h.html#a0758074b9942c2ad076610b3e0ce548e">UT_hash_table</a></div><div class="ttdeci">struct UT_hash_table UT_hash_table</div></div>
<div class="ttc" id="structUT__hash__table_html_a5f1cec93d5d753ba02097c797e4d67ad"><div class="ttname"><a href="structUT__hash__table.html#a5f1cec93d5d753ba02097c797e4d67ad">UT_hash_table::ideal_chain_maxlen</a></div><div class="ttdeci">unsigned ideal_chain_maxlen</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00937">uthash.h:937</a></div></div>
<div class="ttc" id="uthash_8h_html_a0e3a99ed9f776349720d0c362f956fb6"><div class="ttname"><a href="uthash_8h.html#a0e3a99ed9f776349720d0c362f956fb6">UT_hash_handle</a></div><div class="ttdeci">struct UT_hash_handle UT_hash_handle</div></div>
<div class="ttc" id="structUT__hash__handle_html_a3ec03e34d7975d5c1981c44b324619b2"><div class="ttname"><a href="structUT__hash__handle.html#a3ec03e34d7975d5c1981c44b324619b2">UT_hash_handle::hh_prev</a></div><div class="ttdeci">struct UT_hash_handle * hh_prev</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00965">uthash.h:965</a></div></div>
<div class="ttc" id="structUT__hash__table_html_a74534cc14f080c96f94d8f5da83d9d76"><div class="ttname"><a href="structUT__hash__table.html#a74534cc14f080c96f94d8f5da83d9d76">UT_hash_table::num_items</a></div><div class="ttdeci">unsigned num_items</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00931">uthash.h:931</a></div></div>
<div class="ttc" id="structUT__hash__handle_html_abaf54a69367933df2d45575f48ca6a58"><div class="ttname"><a href="structUT__hash__handle.html#abaf54a69367933df2d45575f48ca6a58">UT_hash_handle::prev</a></div><div class="ttdeci">void * prev</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00963">uthash.h:963</a></div></div>
<div class="ttc" id="structUT__hash__handle_html_a93bc88ffe97f85ea0d9e0056b7118942"><div class="ttname"><a href="structUT__hash__handle.html#a93bc88ffe97f85ea0d9e0056b7118942">UT_hash_handle::next</a></div><div class="ttdeci">void * next</div><div class="ttdef"><b>Definition:</b> <a href="uthash_8h_source.html#l00964">uthash.h:964</a></div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Fri Feb 27 2015 15:15:33 for tinydtls by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.6
</small></address>
</body>
</html>
